A new framework for contour tracing using Euclidean distance mapping
by S. Sobhana Mari; G. Raju
International Journal of Computational Vision and Robotics (IJCVR), Vol. 11, No. 5, 2021

Abstract: In this paper, a new fast, efficient and accurate contour extraction method, using eight sequential Euclidean distance map and connectivity criteria based on maximal disk, is proposed. The connectivity criterion is based on a set of point pairs along the image boundary pixels. The proposed algorithm generates a contour of an image with less number of iterations compared to many of the existing methods. The performance of the proposed algorithm is tested with a database of handwritten character images. In comparison to two standard contour tracing algorithms (the Moore method and the Canny edge detection method), the proposed algorithm found to give good quality contour images and require less computing time. Further, features extracted from contours of handwritten character images, generated using the proposed algorithm, resulted in better recognition accuracy.

Online publication date: Tue, 14-Sep-2021

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Vision and Robotics (IJCVR):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com