DocumentCode :
3298701
Title :
Lambertian reflectance and linear subspaces
Author :
Basri, Ronen ; Jacobs, David
Author_Institution :
Dept. of Comput. Sci., Weizmann Inst. of Sci., Rehovot, Israel
Volume :
2
fYear :
2001
fDate :
2001
Firstpage :
383
Abstract :
We prove that the set of all reflectance functions (the mapping from surface normals to intensities) produced by Lambertian objects under distant, isotropic lighting lies close to a 9D linear subspace. This implies that the images of a convex Lambertian object obtained under a wide variety of lighting conditions can be approximated accurately with a low-dimensional linear subspace, explaining prior empirical results. We also provide a simple analytic characterization of this linear space. We obtain these results by representing lighting using spherical harmonics and describing the effects of Lambertian materials as the analog of a convolution. These results allow us to construct algorithms for object recognition based on linear methods as well as algorithms that use convex optimization to enforce non-negative lighting functions
Keywords :
convex programming; object recognition; Lambertian objects; convex Lambertian object; convex optimization; isotropic lighting; object recognition; reflectance functions; spherical harmonics; Algorithm design and analysis; Computer science; Convolution; Jacobian matrices; Kernel; National electric code; Object recognition; Optimization methods; Power harmonic filters; Reflectivity;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computer Vision, 2001. ICCV 2001. Proceedings. Eighth IEEE International Conference on
Conference_Location :
Vancouver, BC
Print_ISBN :
0-7695-1143-0
Type :
conf
DOI :
10.1109/ICCV.2001.937651
Filename :
937651
Link To Document :
بازگشت