Freeman chain code with digits of unequal cost

Chain codes are the most size-efficient lossless compression methods for representing rasterised binary objects and contours. Satisfactory compression ratio, low processing cost and low storage requirements of the decoder make chain code technique interesting for storage and transmission of predefined graphical objects in embedded environments. Each element in the chain is encoded to show the relative angle difference between two adjacent pixels along the boundary of an object. The cost of binary bits representing the codes are considered to be equal. Yet, more efficient encoding is possible by considering and applying technique that treats the binary bits differently considering its requirement of storage space, energy consumption, speed of execution and etc. This paper considers cost of binary digits as unequal and proposes a new representation of the eight-direction Freeman chain code based on a variation of Huffman coding technique, which considers cost of bits as unequal. The evaluation and comparison of the cost efficiency between classical Freeman chain code and the new representation of the chain code is provided. Our experiments yield that the proposed representation of Freeman Chain code reduces overall storage/transmission cost of encoded objects considerably with compared to classical Freeman chain code.

[1]  Richard M. Karp,et al.  Minimum-redundancy coding for the discrete noiseless channel , 1961, IRE Trans. Inf. Theory.

[2]  Keith Brindley.  International Morse code , 1989 .

[3]  Fernando Pereira,et al.  A contour-based approach to binary shape coding using a multiple grid chain code , 2000, Signal Process. Image Commun..

[4]  Borut Zalik,et al.  An efficient raster font compression for embedded systems , 2010, Pattern Recognit..

[5]  Edgar N. Gilbert,et al.  Coding with digits of unequal cost , 1995, IEEE Trans. Inf. Theory.

[6]  Tung-Shou Chen,et al.  An efficient face detection method using skin-color discovering and chain code , 2002 .

[7]  Borut Zalik,et al.  An efficient chain code with Huffman coding , 2005, Pattern Recognit..

[8]  Gadadhar Sahoo,et al.  A new lossless chain code compression scheme based on substitution , 2011 .

[9]  Ralph M. Krause,et al.  Channels Which Transmit Letters of Unequal Duration , 1962, Inf. Control..

[10]  Ernesto Bribiesca,et al.  A Geometric structure for two-dimensional shapes and three-dimensional surfaces , 1992, Pattern Recognit..

[11]  Ernesto Bribiesca.  A chain code for representing 3D curves , 2000, Pattern Recognit..

[12]  Wojciech Rytter,et al.  Optimal Prefix-Free Codes for Unequal Letter Costs: Dynamic Programming with the Monge Property , 2002, J. Algorithms.

[13]  Shimon Even,et al.  Efficient Generation of Optimal Prefix Code: Equiprobable Words Using Unequal Cost Letters , 1975, JACM.

[14]  D. Huffman.  A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[15]  Ben Varn,et al.  Optimal Variable Length Codes (Arbitrary Symbol Cost and Equal Code Word Probability) , 1971, Inf. Control..

[16]  Claire Mathieu,et al.  Huffman coding with unequal letter costs , 2002, STOC '02.

[17]  Mordecai J. Golin,et al.  Prefix Codes: Equiprobable Words, Unequal Letter Costs , 1994, SIAM J. Comput..

[18]  Mohammad Kaykobad,et al.  Block huffman coding , 2003 .

[19]  Serkan Kaygin,et al.  A new one-pass algorithm to detect region boundaries , 2001, Pattern Recognit. Lett..

[20]  Jing-Yu Yang,et al.  A fast watershed algorithm based on chain code and its application in image segmentation , 2005, Pattern Recognit. Lett..

[21]  Borut Zalik,et al.  Compressed vertex chain codes , 2007, Pattern Recognit..

[22]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[23]  Borut Zalik,et al.  Directional difference chain codes with quasi-lossless compression and run-length encoding , 2012, Signal Process. Image Commun..

[24]  Jing-Yu Yang,et al.  Tracing boundary contours in a binary image , 2002, Image Vis. Comput..

[25]  Jonathan Amsterdam,et al.  Data compression with Huffman coding , 1986 .

[26]  I Ketut Gede Darma Putra,et al.  Hand Geometry Verification based on Chain Code and Dynamic Time Warping , 2012 .

[27]  Francisco Sandoval Hernández,et al.  Corner detection and curve segmentation by multiresolution chain-code linking , 2005, Pattern Recognit..

[28]  H. W. Moorshead.  INTERNATIONAL MORSE CODE , 1978 .

[29]  Claire Mathieu,et al.  SC-2 00 202 Huffman Coding with Unequal Letter Costs [ Extended Abstract ] , 2002 .

[30]  Sohag Kabir,et al.  Effects of unequal bit costs on classical Huffman codes , 2014, 2014 17th International Conference on Computer and Information Technology (ICCIT).

[31]  Ernesto Bribiesca,et al.  A new chain code , 1999, Pattern Recognit..

[32]  Kurt Mehlhorn,et al.  Codes: Unequal Probabilities, Unequal Letter Cost , 1980, JACM.

[33]  S J Lin,et al.  Voxel-based texture mapping for medical data. , 2002, Computerized medical imaging and graphics : the official journal of the Computerized Medical Imaging Society.