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 movebment.
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).
- 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.
- Žalik, Borut; Lukač Niko (2013). "Chain code lossless compression using move-to-front transform and adaptive run-length encoding". Signal Processing: Image Communication. doi:10.1016/j.image.2013.09.002.