International Journal of Image, Graphics and Signal Processing (IJIGSP)
IJIGSP Vol. 7, No. 10, 8 Sep. 2015
Cover page and Table of Contents: PDF (size: 784KB)
A Compressed Representation of Mid-Crack Code with Huffman Code
Full Text (PDF, 784KB), PP.11-18
Views: 0 Downloads: 0
Author(s)
Sohag Kabir
1,*
Index Terms
Image Processin, Mid-crack Code, Huffman Code, Image Compression, Image Communication, Pattern Recognition, Contour Coding
Abstract
Contour representation of binary object is increasingly used in image processing and pattern recognition. Chain code and crack code are popular methods of contour encoding. However, by using these methods, an accurate estimate of geometric features like area and perimeter of objects are difficult to obtain. Mid-crack code, another contour encoding method, can help to obtain more accurate estimate of the geometric features of objects. Though a considerable amount of reduction of the size of images is obtained by fixed-length mid-crack code, yet, more efficient encoding is possible by considering and applying variable-length encoding technique. In this paper, a compressed mid-crack code is proposed based on the Huffman code. Experiments performed on different images yield that the proposed representation reduces the number of bits require to encode the contour of an image with compared to the classical mid-crack code.
Cite This Paper
Sohag Kabir,"A Compressed Representation of Mid-Crack Code with Huffman Code", IJIGSP, vol.7, no.10, pp.11-18, 2015. DOI: 10.5815/ijigsp.2015.10.02
Reference
[1]H. Freeman, "On the Encoding of Arbitrary Geometric Configurations," IRE Trans. Electron. Comput., vol. EC-10, no. 2, pp. 260–268, 1961.
[2]F. Y. Shih and W.-T. Wong, "An adaptive algorithm for conversion from quadtree to chain codes," Pattern Recognit., vol. 34, no. 3, pp. 631–639, 2001.
[3]F. Y. Shih and W.-T. Wong, "A one-pass algorithm for local symmetry of contours from chain codes," Pattern Recognit., vol. 32, no. 7, pp. 1203–1210, 1999.
[4]G. R. Wilson, "Properties of contour codes," IEE Proc. Vision, Image Signal Process., vol. 144, no. 3, pp. 145–149, Jun. 1997.
[5]K. Dunkelberger and O. R. Mitchell, "Contour tracing for precision measurement," in Proceedings of International Conference on Robotics and Automation, 1985, vol. 2, pp. 22–27.
[6]G. R. Wilson and B. G. Batchelor, "Algorithm for forming relationships between objects in a scene," IEEE Proc. Comput. Digit. Tech., vol. 137, no. 2, pp. 151–153, Mar. 1990.
[7]W.-T. Wong, "Parallelization for image processing algorithms based chain and mid-crack codes," New Jersey Institute of Technology, 1999.
[8]D. A. Huffman, "A Method for the Construction of Minimum-Redundancy Codes," Proc. Inst. Radio Eng., vol. 40, no. 9, pp. 1098–1101, Sep. 1952.
[9]Y. K. Liu and B. ?alik, "An efficient chain code with Huffman coding," Pattern Recognit., vol. 38, no. 4, pp. 553–557, 2005.
[10]F. Y. Shih and W.-T. Wong, "A new single-pass algorithm for extracting the mid-crack codes of multiple regions," J. Vis. Commun. Image Represent., vol. 3, no. 1, pp. 217–224, Mar. 1992.
[11]F. Y. Shih and W.-T. Wong, "A new safe-point thinning algorithm based on the mid-crack code tracing," IEEE Trans. Syst. Man Cybern., vol. 25, no. 2, pp. 370–378, Feb. 1995.
[12]Y.-K. Liu, B. Žalik, P. Wang, and D. Podgorelec, "Directional difference chain codes with quasi-lossless compression and run-length encoding," Signal Process. Image Commun., vol. 27, no. 9, pp. 973–984, 2012.
[13]B. Žalik and N. Lukač, "Chain code lossless compression using move-to-front transform and adaptive run-length encoding," Signal Process. Image Commun., vol. 29, no. 1, pp. 96–106, 2014.
[14]S. Kabir, T. Azad, and A. S. M. A. Alam, "Freeman Chain Code with Digits of Unequal Cost," in The 8th International Conference on Software, Knowledge, Information Management and Applications (SKIMA), 2014, pp. 1–6.
[15]Y. K. Liu, W. Wei, P. J. Wang, and B. Žalik, "Compressed vertex chain codes," Pattern Recognit., vol. 40, no. 11, pp. 2908–2913, 2007.
[16]J. Amsterdam, "Data compression with Huffman coding," BYTE, vol. 11, no. 5, pp. 98–108, 1986.
[17]E. Bribiesca, "A new chain code," Pattern Recognit., vol. 32, no. 2, pp. 235–251, 1999.
[18]S. Kabir, T. Azad, A. S. M. A. Alam, and M. Kaykobad, "Effects of Unequal Bit Costs on Classical Huffman Codes," in The 17th International Conference on Computer and Information Technology (ICCIT), 2014, pp. 96–101.