Translator Disclaimer
21 May 1993 Edges from projections
Author Affiliations +
Proceedings Volume 1902, Nonlinear Image Processing IV; (1993) https://doi.org/10.1117/12.144752
Event: IS&T/SPIE's Symposium on Electronic Imaging: Science and Technology, 1993, San Jose, CA, United States
Abstract
A line sketch of a 3-dimensional scene provides important information about objects in the scene and about their spatial relationships. Considerable effort has been reported in the literature describing methods of extracting line sketches from 2-dimensional projected images of scenes. In this paper a projection based approach is described for detecting boundaries in an image having linear segments. This method can be utilized for the recognition of polyhedral objects or for the identification of familiar objects for mobile robot location. The computational performance of this algorithm is greatly enhanced by operating directly on the gray-scale image and by starting with a coarse (low resolution) image and moving successively to higher resolutions at regions of interest (i.e., brightness discontinuities). A complete circular projection of the higher level image is computed and the discontinuities in this projection are located using the derivatives of the projection at fixed angles. Peaks in this function correspond to lines in the original image. A vertex extraction algorithm has been developed to establish the edge extent in the image. These methods have been implemented and tested with real and synthetic images and are believed to be better than methods that use edge enhancement/thresholding and then employ the Hough transform to isolate lines in the image.
© (1993) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Raashid Malik and Purnendu Sinha "Edges from projections", Proc. SPIE 1902, Nonlinear Image Processing IV, (21 May 1993); https://doi.org/10.1117/12.144752
PROCEEDINGS
11 PAGES


SHARE
Advertisement
Advertisement
RELATED CONTENT


Back to Top