Fast multiresolution contour completion

G. Papari; N. Petkov

doi:10.1117/12.767344

3 March 2008 Fast multiresolution contour completion

G. Papari, N. Petkov

Author Affiliations +

Proceedings Volume 6812, Image Processing: Algorithms and Systems VI; 68121B (2008) https://doi.org/10.1117/12.767344
Event: Electronic Imaging, 2008, San Jose, California, United States

Abstract

We consider the problem of improving contour detection by filling gaps between collinear contour pieces. A fast algorithm is proposed which takes into account local edge orientation and local curvature. Each edge point is replaced by a curved elongated patch, whose orientation and curvature match the local edge orientation and edge. The proposed contour completion algorithm is integrated in a multiresolution framework for contour detection. Experimental results show the superiority of the proposed method to other well-established approaches.

Citation Download Citation

G. Papari and N. Petkov "Fast multiresolution contour completion", Proc. SPIE 6812, Image Processing: Algorithms and Systems VI, 68121B (3 March 2008); https://doi.org/10.1117/12.767344

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