World Library  
Flag as Inappropriate
Email this Article

Chain code

Article Id: WHEBN0023338549
Reproduction Date:

Title: Chain code  
Author: World Heritage Encyclopedia
Language: English
Subject: Image compression, Gray code, Context tree weighting, Warped linear predictive coding, Log area ratio
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Chain code

A chain code is a lossless compression algorithm for monochrome images. The basic principle of chain codes is to separately encode each connected component, or "blob", in the image.

For each such region, a point on the boundary is selected and its coordinates are transmitted. The encoder then moves along the boundary of the region and, at each step, transmits a symbol representing the direction of this movement.

This continues until the encoder returns to the starting position, at which point the blob has been completely described, and encoding continues with the next blob in the image.

This encoding method is particularly effective for images consisting of a reasonably small number of large connected components.

Variations

Some popular chain codes include the Freeman Chain Code of Eight Directions[1] (FCCE), Vertex Chain Code[2] (VCC), Three OrThogonal symbol chain code[3] (3OT) and Directional Freeman Chain Code of Eight Directions[4] (DFCCE).

A related blob encoding method is crack code.[5] Algorithms exist to convert between chain code, crack code, and run-length encoding.

In use

Recently, the combination of Move-to-front transform and adaptive Run-length encoding accomplished efficient compression of the popular chain codes. [6]

See also

References

  1. ^ H. Freeman. On the encoding of arbitrary geometric configurations, IRE Transactions on Electronic Computers EC- 10(1961) 260-268.
  2. ^ E. Bribiesca, A new chain code, Pattern Recognition 32 (1999) 235–251.
  3. ^ H. Sánchez-Cruz, R. M. Rodríguez-Dagnino. Compressing bi-level images by means of a 3-bit chain code. Optical Engineering. SPIE. 44 (9) 097004 (2005) 1-8.
  4. ^ Y.K. Liu, B.Zalik, An efficient chain code with Huffman coding, Pattern Recognition 38 (4) (2005) 553-557.
  5. ^ A. Rosenfeld, A. C. Kak. Digital Picture Processing, 2nd edition (1982). Page 220. Academic Press, Inc. Orlando, FL, USA.
  6. ^ Žalik, Borut; Lukač Niko (2013). "Chain code lossless compression using move-to-front transform and adaptive run-length encoding". Signal Processing: Image Communication.  


This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.