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

Authors:
Yong-Kui Liu;Borut Alik;Peng-Jie Wang;David Podgorelec
Affiliations:
College of Computer Science and Engineering, Dalian Nationalities University, Dalian, China;Faculty of Electrical Engineering and Computer Science, University of Maribor, SI-2000 Maribor, Slovenia;College of Computer Science and Engineering, Dalian Nationalities University, Dalian, China and State Key Laboratory of CAD & CG, Zhejiang University, Hangzhou 310027, China;Faculty of Electrical Engineering and Computer Science, University of Maribor, SI-2000 Maribor, Slovenia
Venue:
Image Communication
Year:
2012

Citing 18
Cited 1

Encoding of Line Drawings with a Multiple Grid Chain Code

IEEE Transactions on Pattern Analysis and Machine Intelligence
Computer Processing of Line-Drawing Images

ACM Computing Surveys (CSUR)
A new one-pass algorithm to detect region boundaries

Pattern Recognition Letters
An efficient face detection method using skin-color discovering and chain code

Machine Graphics & Vision International Journal - Special issue on latest results in colour image processing and applications
Highly efficient coding schemes for contour line drawings

ICIP '95 Proceedings of the 1995 International Conference on Image Processing (Vol. 3)-Volume 3 - Volume 3
Multi-grid chain coding of binary shapes

ICIP '97 Proceedings of the 1997 International Conference on Image Processing (ICIP '97) 3-Volume Set-Volume 3 - Volume 3
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
Lossless compression of map contours by context tree modeling of chain codes

Pattern Recognition
Efficiency of chain codes to represent binary objects

Pattern Recognition
Compressed vertex chain codes

Pattern Recognition
Compact representation of contours using directional grid chain code

Image Communication
Algorithm for Length Estimation Based on the Vertex Chain Code

ICSPS '09 Proceedings of the 2009 International Conference on Signal Processing Systems
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
An efficient chain code with Huffman coding

Pattern Recognition
A new and fast contour-filling algorithm

Pattern Recognition
Proposing a new code by considering pieces of discrete straight lines in contour shapes

Journal of Visual Communication and Image Representation
An efficient raster font compression for embedded systems

Pattern Recognition
A universal data compression system

IEEE Transactions on Information Theory

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 paper considers a new contour-based representation of binary objects in raster images. Low processing and storage requirements of the decoder, satisfactory compression ratio and generality make this chain coding technique interesting for storing predefined graphical objects in embedded systems. Three improvements of the DDCC code were introduced. Extra Huffman codes are assigned to two frequent pairs of symbols, 135^o directional differences in concave angles are omitted since they do not affect the outer object shape and, finally, longer line segments are run-length encoded. Comparison with six other chain coding techniques of similar implementation complexity confirms that the new technique represents an efficient alternative way to encode 8-connected contours.