Coding Long Contour Shapes of Binary Objects

Authors:
Hermilo Sánchez-Cruz;Mario A. Rodríguez-Díaz
Affiliations:
Departmento de Sistemas Electrónicos. Centro de Ciencias Básicas, Universidad Autónoma de Aguascalientes, Aguascalientes, Ags., México C.P. 20100;Departmento de Sistemas Electrónicos. Centro de Ciencias Básicas, Universidad Autónoma de Aguascalientes, Aguascalientes, Ags., México C.P. 20100
Venue:
CIARP '09 Proceedings of the 14th Iberoamerican Conference on Pattern Recognition: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications
Year:
2009

Citing 10
Cited 2

String matching in Lempel-Ziv compressed strings

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Computer Processing of Line-Drawing Images

ACM Computing Surveys (CSUR)
A New Chain-code Quantization Approach Enabling High Performance Handwriting Recognition based on Multi-Classifier Schemes

ICDAR '03 Proceedings of the Seventh International Conference on Document Analysis and Recognition - Volume 2
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
A proposal modification of the 3OT chain code

CGIM '08 Proceedings of the Tenth IASTED International Conference on Computer Graphics and Imaging
An efficient chain code with Huffman coding

Pattern Recognition
A proposal method for corner detection with an orthogonal three-direction chain code

ACIVS'06 Proceedings of the 8th international conference on Advanced Concepts For Intelligent Vision Systems
The emerging JBIG2 standard

IEEE Transactions on Circuits and Systems for Video Technology

Directional difference chain codes with quasi-lossless compression and run-length encoding

Image Communication
Chain code lossless compression using move-to-front transform and adaptive run-length encoding

Image Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

This is an extension of the paper appeared in [15]. This time, we compare four methods: Arithmetic coding applied to 3OT chain code (Arith-3OT), Arithmetic coding applied to DFCCE (Arith-DFCCE), Huffman coding applied to DFCCE chain code (Huff-DFCCE), and, to measure the efficiency of the chain codes, we propose to compare the methods with JBIG, which constitutes an international standard. In the aim to look for a suitable and better representation of contour shapes, our probes suggest that a sound method to represent contour shapes is 3OT, because Arithmetic coding applied to it gives the best results regarding JBIG, independently of the perimeter of the contour shapes.