26 October 1983 Curvilinear Feature Extraction And Approximations
Author Affiliations +
Proceedings Volume 0397, Applications of Digital Image Processing V; (1983) https://doi.org/10.1117/12.935288
Event: 1983 International Technical Conference/Europe, 1983, Geneva, Switzerland
Abstract
Most of edge extraction techniques are local operators, thus providing only local information without providing any structural information. Therefore edge points themselves are not adequate as primitive descriptors in computer vision, and local edge points need to be linked into long, straight or slowly curving, line segments. In this paper, a simple and efficient curvilinear feature extraction algorithm using minimum spanning trees is described. The new algorithm is based on the minimum spanning trees found from the edge points. The purpose of finding minimum spanning trees is to link edge points, thus filling gaps and providing structural information. An approximation technique which transforms curvilinear features into straight lines is also described.
© (1983) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Minsoo Suk, Minsoo Suk, Sanghoon Sull, Sanghoon Sull, } "Curvilinear Feature Extraction And Approximations", Proc. SPIE 0397, Applications of Digital Image Processing V, (26 October 1983); doi: 10.1117/12.935288; https://doi.org/10.1117/12.935288
PROCEEDINGS
7 PAGES


SHARE
RELATED CONTENT

A new method for fast circle detection in a complex...
Proceedings of SPIE (December 02 2011)
Local window approach to detect line segment based on line...
Proceedings of SPIE (September 21 2001)
Integration and use of a 3 D vision system in...
Proceedings of SPIE (March 01 1992)
New entropy operator for edge abstraction
Proceedings of SPIE (August 20 1993)
Vertices and corners: normalized average detection
Proceedings of SPIE (August 20 1993)
Hierarchical object boundary detection and description
Proceedings of SPIE (August 01 1990)

Back to Top