• DocumentCode
    698570
  • Title

    Lossless contour representation using efficient multiple grid chain coding

  • Author

    Heechan Park ; Martin, Graham R. ; Yu, Andy C.

  • Author_Institution
    Dept. of Comput. Sci., Univ. of Warwick, Coventry, UK
  • fYear
    2005
  • fDate
    4-8 Sept. 2005
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    We present an efficient lossless contour coding scheme based on a chain code representation. The algorithm is suitable for the binary shape coding of arbitrarily-shaped objects. Previous attempts to exploit the correlation between successive chain links have resulted in a complex encoding process, due either to the employment of chain code post processing or by dividing the contour into segments. Our approach exploits the differential predictability of contour smoothness by embedding it into the chain structure. Anisotropic chain links are applied in the direction of the contour according to selection rules that exploit contour coherence effectively. Experimental evaluation indicates that the proposed algorithm provides superior performance over existing chain coding schemes, and implementation complexity is not increased.
  • Keywords
    image coding; image representation; shape recognition; anisotropic chain links; arbitrarily-shaped objects; binary shape coding; chain code post processing; chain code representation; chain structure; complex encoding process; contour coherence; contour smoothness; differential predictability; efficient lossless contour coding scheme; efficient multiple grid chain coding; implementation complexity; lossless contour representation; selection rules; successive chain links; Coherence; Containers; Decoding; Encoding; Meteorology; Shape; Transform coding;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Signal Processing Conference, 2005 13th European
  • Conference_Location
    Antalya
  • Print_ISBN
    978-160-4238-21-1
  • Type

    conf

  • Filename
    7078158