23 September 1999 Lawn-mowing algorithm for noisy gradient vector fields
Author Affiliations +
Abstract
In this paper we analyze a specific problem within the context of recovering the geometric shape of an unknown surface from multiple noisy shading patterns generated by consecutive parallel illuminations by different light-sources. Shading- based single-view shape recovery in computer vision often leads to vector fields (i.e. estimated surface normals) which have to be integrated for calculations of height or depth maps. We present an algorithm for enforcing the integrability condition of a given non-integrable vector field which ensures a global suboptimal solution by local optimizations. The scheme in question relies neither on a priori knowledge of boundary conditions nor on other global constraints imposed on the so-far derived noise contaminated gradient integration techniques. The discussion is supplemented by examples illustrating algorithm performance.
© (1999) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Lyle Noakes, Lyle Noakes, Ryszard Kozera, Ryszard Kozera, Reinhard Klette, Reinhard Klette, } "Lawn-mowing algorithm for noisy gradient vector fields", Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); doi: 10.1117/12.364106; https://doi.org/10.1117/12.364106
PROCEEDINGS
12 PAGES


SHARE
RELATED CONTENT

Toward accurate and automatic morphing
Proceedings of SPIE (October 24 2005)
Searching strain field parameters by genetic algorithms
Proceedings of SPIE (September 09 2007)
Direct method for reconstructing shape from shading
Proceedings of SPIE (August 31 1991)
Applications Of The Provision Language In Robot Vision
Proceedings of SPIE (March 26 1989)
2D leapfrog algorithm for optimal surface reconstruction
Proceedings of SPIE (September 22 1999)

Back to Top