Haron, Habibollah and Wulandhari, Lili A. and Sallehuddin, Roselina (2011) The mapping algorithm of triangular vertex chain code from thinned binary image. In: Second International Conference On Recent Trends In Information Processing & Computing (Ipc 2011).
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/978-3-642-32573-1_17
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.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Uncontrolled Keywords: | Vertex Chain Code, Triangular Cells, Thinned Binary Image |
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Computing |
| ID Code: | 46372 |
| Deposited By: | Haliza Zainal |
| Deposited On: | 10 Jun 2015 03:01 |
| Last Modified: | 02 Jul 2017 08:46 |
Repository Staff Only: item control page
