The mapping algorithm of triangular Vertex Chain Code from thinned binary image

0Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Image representation has always been an important and interesting topic in image processing and pattern recognition. In 1999, Bribiesca introduced a new two dimensional chain code scheme called Vertex Chain Code (VCC). VCC is composed of three regular cells, namely rectangular, triangular, and hexagonal. This paper presents the mapping algorithm that covers one of the VCC cells, the Triangular VCC cell. The mapping algorithm consists of a cell-representation algorithm that represents a thinned binary image into triangular cells, and a transcribing algorithm that transcribes the cells into Vertex Chain Code. The algorithms have been tested and validated by using three thinned binary images: L-block, hexagon and pentagon. The results show that this algorithm is capable of visualizing and transcribing them into VCC; it can also be improved by testing on more thinned binary images. © 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering.

Cite

CITATION STYLE

APA

Wulandhari, L. A., Haron, H., & Sallehuddin, R. (2012). The mapping algorithm of triangular Vertex Chain Code from thinned binary image. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering (Vol. 62 LNICST, pp. 108–113). https://doi.org/10.1007/978-3-642-32573-1_17

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