An upper bound on the k-modem illumination problem.
Frank DuqueCarlos Hidalgo-ToscanoPublished in: CoRR (2014)
Keyphrases
- upper bound
- lower bound
- lighting conditions
- illumination conditions
- worst case
- single image
- branch and bound algorithm
- branch and bound
- upper and lower bounds
- illumination invariant
- lower and upper bounds
- color constancy
- pose variations
- robust face recognition
- face recognition under varying
- error probability
- imaging conditions
- pixel intensities
- network architecture
- partial occlusion
- viewpoint
- outdoor scenes
- object motion
- illumination variations
- varying illumination
- special case
- global illumination
- search algorithm