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.
Some popular chain codes include the Freeman Chain Code of Eight Directions (FCCE), Vertex Chain Code (VCC), Three OrThogonal symbol chain code (3OT) and Directional Freeman Chain Code of Eight Directions (DFCCE).
A related blob encoding method is crack code. Algorithms exist to convert between chain code, crack code, and run-length encoding.
- H. Freeman. On the encoding of arbitrary geometric configurations, IRE Transactions on Electronic Computers EC- 10(1961) 260-268.
- E. Bribiesca, A new chain code, Pattern Recognition 32 (1999) 235–251.
- 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.
- Y.K. Liu, B.Zalik, An efficient chain code with Huffman coding, Pattern Recognition 38 (4) (2005) 553-557.
- A. Rosenfeld, A. C. Kak. Digital Picture Processing, 2nd edition (1982). Page 220. Academic Press, Inc. Orlando, FL, USA.
|This computer graphics–related article is a stub. You can help Wikipedia by expanding it.|
|This signal processing-related article is a stub. You can help Wikipedia by expanding it.|