Haron, Habibollah (2008) The mapping algorithm of rectangular vertex chain code from thinned binary image. In: International Conference on Engineering Optimization Rio Othon Palace Hotel Rio De Janeiro, Brazil, 2008, Rio Othon Palace Hotel, Rio de Janeiro.
Image representation always becomes an important and interesting topic in image processing and pattern recognition. Since introduced by Freeman in 1961, that is known as Freeman Chain Code (FCC) the evolution and improvement of chain code representation scheme has been widely used as a topic of research. In 1999, Bribiesca introduced a new two-dimensional chain code scheme that is called Vertex Chain Code (VCC). An element of this chain indicates the number of cell vertices, which are in touch with the bounding contour of the shape in that element position. The VCC is composed of three regular cells, namely rectangular, triangular, and hexagonal. This paper covers one of the VCC cells, namely Rectangular – VCC cell. An algorithm is developed to visualize a thinned binary image into rectangular cells and to transcribe the cells into Vertex Chain Code. The algorithm has been tested and validated in visualizing thinned binary images into rectangular-VCC cells and transcribing the cells into VCC by using three thinned binary images, which are cube, stair and rectangle. The results show that this algorithm is capable to visualize and transcribe them into VCC, and it also can be improved by testing on more thinned binary images.
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||vertex chain code, rectangular cells, thinned binary image, picture description language|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Computer Science and Information System (Formerly known)|
|Deposited By:||Liza Porijo|
|Last Modified:||15 Dec 2011 07:37|
Repository Staff Only: item control page