The Community for Technology Leaders
Pattern Recognition, International Conference on (2004)
Cambridge UK
Aug. 23, 2004 to Aug. 26, 2004
ISSN: 1051-4651
ISBN: 0-7695-2128-2
pp: 115-118
Mario Castelan , University of York, UK
Edwin R. Hancock , University of York, UK
ABSTRACT
This paper describes a shape-from-shading algorithm that combines constraint on data-closeness from Lambert's law and Fourier domain integrability. The data closeness is ensured by constraining surface normals to fall on an irradiance cone, whose axis points in the light source direction and whose apex angle varies with iteration number. The integrability is ensured by projecting the non-integrable set of surface normals to the nearest integrable one by globally minimizing the distance among them in the Fourier domain. The combination of both data-closeness and integrability constraints is aimed to overcome the problem of high dependency on the image irradiances. Experimental results prove that the new method recovers needle maps that are both smooth and integrable and improves height surface stability.
INDEX TERMS
null
CITATION

E. R. Hancock and M. Castelan, "Combining Data-Closeness and Fourier Domain Integrability Constraints in Shape-from-Shading," Pattern Recognition, International Conference on(ICPR), Cambridge UK, 2004, pp. 115-118.
doi:10.1109/ICPR.2004.1334482
87 ms
(Ver 3.3 (11022016))