Paper
23 September 1999 Lawn-mowing algorithm for noisy gradient vector fields
Lyle Noakes, Ryszard Kozera, Reinhard Klette
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, Ryszard Kozera, and Reinhard Klette "Lawn-mowing algorithm for noisy gradient vector fields", Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); https://doi.org/10.1117/12.364106
Lens.org Logo
CITATIONS
Cited by 15 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Optimization (mathematics)

Reconstruction algorithms

Computer vision technology

Machine vision

Matrices

Cameras

Shape analysis

RELATED CONTENT


Back to Top