Improved vertex chain code based mapping algorithm for curve length estimation

22Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

Abstract

Problem statement: Image representation has always been an important and interesting topic in image processing and pattern recognition. However, curve tracing and its relative operations are the main bottleneck. Approach: This research presents the mapping algorithm that covers one of the vertex chain code cells, the rectangular-VCC cell. The mapping algorithm consists of a cell-representation algorithm that represents a thinned binary image in rectangular cells, a transcribing algorithm that transcribes the cells into vertex chain code and a validation algorithm that visualizes vertex chain code into rectangular cells. Results: The algorithms have been tested and validated by using three thinned binary images: L-block, hexagon and pentagon. Conclusion/Recommendations: The results show that this algorithm is capable of visualizing and transcribing them into vertex chain code. © 2011 Science Publications.

Cite

CITATION STYLE

APA

Haron, H., Rehman, A., Wulandhari, L. A., & Saba, T. (2011). Improved vertex chain code based mapping algorithm for curve length estimation. Journal of Computer Science, 7(5), 736–743. https://doi.org/10.3844/jcssp.2011.736.743

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free