Share Email Print

Proceedings Paper

Algorithm to locate the nodal points of a projected mesh
Author(s): Charalabos Brilakis
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 27 February 1996
PDF: 11 pages
Proc. SPIE 2727, Visual Communications and Image Processing '96, (27 February 1996); doi: 10.1117/12.233263
Show Author Affiliations
Charalabos Brilakis, Bell Communications Research (United States)

Published in SPIE Proceedings Vol. 2727:
Visual Communications and Image Processing '96
Rashid Ansari; Mark J. T. Smith, Editor(s)

© SPIE. Terms of Use
Back to Top