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

Authors:
Borut Alik;Niko Lukač
Affiliations:
-;-
Venue:
Image Communication
Year:
2014

Citing 18
Cited 0

A locally adaptive data compression scheme

Communications of the ACM
Off-Line Cursive Script Word Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
A survey of multimedia compression techniques and standards. Part I: JPEG standard

Real-Time Imaging
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
Data Compression

Data Compression
Image Processing, Analysis, and Machine Vision

Image Processing, Analysis, and Machine Vision
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
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
An efficient chain code with Huffman coding

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
Automatic extraction of free-form surface features (FFSFs)

Computer-Aided Design
Object-adaptive vertex-based shape coding method

IEEE Transactions on Circuits and Systems for Video Technology
Object-based analysis-synthesis coding of image sequences at very low bit rates

IEEE Transactions on Circuits and Systems for Video Technology
Directional difference chain codes with quasi-lossless compression and run-length encoding

Image Communication

Quantified Score

Hi-index	0.00

Visualization

Abstract

Chain codes are the most size-efficient representations of rasterised binary shapes and contours. This paper considers a new lossless chain code compression method based on move-to-front transform and an adaptive run-length encoding. The former reduces the information entropy of the chain code, whilst the latter compresses the entropy-reduced chain code by coding the repetitions of chain code symbols and their combinations using a variable-length model. In comparison to other state-of-the-art compression methods, the entropy-reduction is highly efficient, and the newly proposed method yields, on average, better compression.