A proposal modification of the 3OT chain code

Authors:
Hermilo Sánchez-Cruz;Marcos López-Cruces;Hector Puga
Affiliations:
Universidad Autónoma de Aguascalientes, Aguascalientes, Aguascalientes, México;Instituto Tecnológico de León, León, Guanajuato, México;Instituto Tecnológico de León, León, Guanajuato, México
Venue:
CGIM '08 Proceedings of the Tenth IASTED International Conference on Computer Graphics and Imaging
Year:
2008

Citing 5
Cited 4

Contour extraction of compressed JPEG images

Journal of Graphics Tools
Efficiency of chain codes to represent binary objects

Pattern Recognition
Compressed vertex chain codes

Pattern Recognition
Computer Recognition of Partial Views of Curved Objects

IEEE Transactions on Computers
An efficient chain code with Huffman coding

Pattern Recognition

Coding Long Contour Shapes of Binary Objects

CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Proposing a new code by considering pieces of discrete straight lines in contour shapes

Journal of Visual Communication and Image Representation
A new relative chain code in 3D

Pattern Recognition
Chain code lossless compression using move-to-front transform and adaptive run-length encoding

Image Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new set of symbols, M_3OT, based on orthogonal changes given by the 3OT chain code is presented. A sample of contour shapes to test the new code is used, and the most important chain codes and their compression levels are compared with our proposed new code. The compression used to compare the different chain codes is the Huffman algorithm applied to the resulted chain codes. The efficiency and compression level of this new chain code is compared against the most popular codes: F8, F4, VCC, C_VCC and DF8. We discuss the capabilities of the different codes. The results of several samples show that the new chain code, that we call M_3OT is the most efficient than the predecessors.