Paper
27 February 1996 Algorithm to locate the nodal points of a projected mesh
Charalabos Brilakis
Author Affiliations +
Proceedings Volume 2727, Visual Communications and Image Processing '96; (1996) https://doi.org/10.1117/12.233263
Event: Visual Communications and Image Processing '96, 1996, Orlando, FL, United States
Abstract
An algorithm to automate the classical image processing method for analyzing the three- dimensional (3-D) shape of an object's surface, using shape from stereo, is proposed. An orthogonal mesh (two-dimensional cross grating) is projected on the object's surface and it is recorded as images with two device cameras. For correspondence between the surface of the object and the images, the grating line numbers are used. Therefore, the pixel positions of the nodal points of the mesh (the intersections of the center lines of the grating lines) must be located. These are the interest points, used for correspondence. The algorithm proposed in this paper is dealing with the problem of locating these points. The traditional thresholding and thinning procedure doesn't perform very well, therefore the points are located as the centers of the intersection areas.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Charalabos Brilakis "Algorithm to locate the nodal points of a projected mesh", Proc. SPIE 2727, Visual Communications and Image Processing '96, (27 February 1996); https://doi.org/10.1117/12.233263
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Cameras

Image processing algorithms and systems

Image segmentation

3D image processing

Image processing

Image analysis

Shape analysis

RELATED CONTENT

Iconic-symbolic interfaces
Proceedings of SPIE (April 30 1992)
Image analysis of multiple moving wood pieces in real time
Proceedings of SPIE (February 15 2006)

Back to Top