Efficiency of chain codes to represent binary objects
作者:
Highlights:
•
摘要
We present a study of compression efficiency for binary objects or bi-level images for different chain-code schemes. Chain-code techniques are used for compression of bi-level images because they preserve information and allow a considerable data reduction. Furthermore, chain codes are the standard input format for numerous shape-analysis algorithms. In this work we apply chain codes to represent object with holes and we compare their compression efficiency for seven chain codes. We have also compared all these chain codes with the JBIG standard for bi-level images.
论文关键词:Chain coding,Shapes,Bi-level images,Huffman algorithm,Entropy
论文评审过程:Received 26 January 2006, Revised 2 October 2006, Accepted 6 October 2006, Available online 28 November 2006.
论文官网地址:https://doi.org/10.1016/j.patcog.2006.10.013