Compressing bilevel images by means of a three-bit chain code -: art. no. 097004

作     者：Sánchez-Cruz, H Rodríguez-Dagnino, RM 

作者机构：Univ Autonoma Aguascalientes Ctr Ciencias Basicas Dept Sistemas Elect Aguascalinetes 20100 Mexico Monterrey Inst Technol Ctr Elect & Telecomunicac Monterrey 64849 NL Mexico 

出 版 物：《OPTICAL ENGINEERING》 (Opt Eng)

年 卷 期：2005年第44卷第9期

核心收录：

学科分类：08[工学] 080401[工学-精密仪器及机械] 0804[工学-仪器科学与技术] 081102[工学-检测技术与自动化装置] 0811[工学-控制科学与工程] 0702[理学-物理学] 

基　　金：We would like to thank ITESM  Campus Monterrey  through the Research Chair in Telecommunications  for the provided support in the development of this work  and thank the Electronics Systems Department of Aguascali-entes Autonomous University for their encouragement in finishing this work 

主　　题：2-D binary object contour chain code Huffman algorithm 

摘      要：We propose a lossless compression method based on a chain code composed of only three symbols. The method is applicable to compress 2-D binary object shapes, and it consists of representing the orthogonal direction changes of the discrete contour, corresponding to each object binary shape, by three bits of a chain code. According to our experimental results, we find that this method is suitable for the representation of bilevel images. The results are about 25% more efficient in compression than the Freeman chain code method, and an average of 29% better than the Joint Bilevel Image Experts Group (JBIG) compressor. (c) 2005 society of Photo-Optical Instrumentation Engineers.