• DocumentCode
    381880
  • Title

    Scalable ideal-segmented chain coding

  • Author

    Yeh, Mei-Chen ; Huang, Yen-Lin ; Wang, Jia-Shung

  • Author_Institution
    Dept. of Comput. Sci., Nat. Tsing Hua Univ., Hsinchu, Taiwan
  • Volume
    1
  • fYear
    2002
  • fDate
    2002
  • Abstract
    We present an optimal chain-code-like representation to code contour shapes; in addition, this representation can be easily extended to a scalable form which structures shape data as the base layer followed by two enhancement layers. A lossy coding scheme is also presented for low-bit-rate applications. Compared with the block-based CAE (context-based arithmetic encoding) method in MPEG-4 and DCC (differential chain coding) with an arithmetic coder, our method not only has a higher compression ratio with fewer computation steps, but also can be applied to layered transmission. The scalability achieved by our scheme can be recognized both spatially and quality-wise. Compared with other scalable shape coding methods, our scheme is simple but more efficient than progressive polygon encoding methods. In case of a base layer with distortion Dn=0.02, our scheme saves about 20-30% of the number of bits, that is, we have a smaller size base layer, which is important in layered transmission.
  • Keywords
    arithmetic codes; binary codes; data compression; image segmentation; video coding; MPEG-4; binary shape coding; compression ratio; context-based arithmetic encoding; contour shapes; differential chain coding; lossy coding; scalability; test sequences; Arithmetic; Computer aided engineering; Computer science; Encoding; Entropy coding; Layout; MPEG 4 Standard; Scalability; Shape; Turning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Image Processing. 2002. Proceedings. 2002 International Conference on
  • ISSN
    1522-4880
  • Print_ISBN
    0-7803-7622-6
  • Type

    conf

  • DOI
    10.1109/ICIP.2002.1037993
  • Filename
    1037993