Curvilinear Feature Extraction And Approximations

Minsoo Suk; Sanghoon Sull

doi:10.1117/12.935288

26 October 1983 Curvilinear Feature Extraction And Approximations

Minsoo Suk, Sanghoon Sull

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.

Citation Download Citation

Minsoo Suk and Sanghoon Sull "Curvilinear Feature Extraction And Approximations", Proc. SPIE 0397, Applications of Digital Image Processing V, (26 October 1983); https://doi.org/10.1117/12.935288

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available