• DocumentCode
    811442
  • Title

    Highly efficient coding schemes for contour lines based on chain code representations

  • Author

    Lu, Cheng-Chang ; Dunham, James G.

  • Author_Institution
    Dept. of Math. Sci., Kent State Univ., OH, USA
  • Volume
    39
  • Issue
    10
  • fYear
    1991
  • fDate
    10/1/1991 12:00:00 AM
  • Firstpage
    1511
  • Lastpage
    1514
  • Abstract
    The encoding schemes utilize the first- and second-order Markov models to describe the source structure. Two coding techniques, Huffman encoding and arithmetic encoding, are used to achieve a high coding efficiency. Universal code tables which match the statistics of contour line drawings obtained from 64 contour maps are presented and can be applied to encode all contour line drawings with chain code representations. Experiments have shown about a 50% improvement on the code amount over the conventional chain encoding scheme with arithmetic coding schemes, and also have shown a compression rate comparable to that obtained by T. Kaneko and M. Okudaira (1985) with Huffman coding schemes, while this implementation is substantially simpler
  • Keywords
    Markov processes; data compression; encoding; picture processing; Huffman encoding; Markov models; arithmetic encoding; chain code representations; compression rate; contour line drawings; high coding efficiency; image processing; Application software; Arithmetic; Data processing; Encoding; Huffman coding; Image coding; Image communication; Image segmentation; Shape; Statistics;
  • fLanguage
    English
  • Journal_Title
    Communications, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0090-6778
  • Type

    jour

  • DOI
    10.1109/26.103046
  • Filename
    103046