Compressed vertex chain codes

Authors:
Yong Kui Liu;Wei Wei;Peng Jie Wang;Borut alik
Affiliations:
Computer Science Department, Dalian Nationalities University, Dalian 116600, China;Computer Science Department, Dalian Nationalities University, Dalian 116600, China;Computer Science Department, Dalian Nationalities University, Dalian 116600, China;Faculty of electrical engineering and computer science, University of Maribor, Smetanova 17, SI-2000 Maribor, Slovenia
Venue:
Pattern Recognition
Year:
2007

Citing 3
Cited 6

Fast Chain Coding of Region Boundaries

IEEE Transactions on Pattern Analysis and Machine Intelligence
A chaincode based scheme for fingerprint feature extraction

Pattern Recognition Letters
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
A proposal modification of the 3OT chain code

CGIM '08 Proceedings of the Tenth IASTED International Conference on Computer Graphics and Imaging
Proposing a new code by considering pieces of discrete straight lines in contour shapes

Journal of Visual Communication and Image Representation
Directional difference chain codes with quasi-lossless compression and run-length encoding

Image Communication
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.01

Visualization

Abstract

This paper introduces three new vertex chain codes. Firstly, considering that the vertex chain code uses 2 bits to represent only three code elements, a new code is introduced without increasing the average bits per code. The second case introduces a variable-length vertex chain code. Finally, a new compressed chain code is proposed based on the Huffman method. The continuation introduces a method for quantificationally evaluating the efficiency of chain codes. The efficiencies of the new vertex chain codes are then compared theoretically and practically against the most popular chain codes. The result of the comparison shows that the new compressed chain code is the most efficient.