An Efficient Chain Code With Huffman Coding

1
An Efficient Chain Code With Huffman Coding

• Pattern Recognition, Vol. 38, No. 4, April 2005,
  pp. 553-557
• Yong Kui Liu and Borut Zalik
• Reporter Jen-Bang Feng(???)

2
Outline

• Applications
• Freeman Chain Code
• The Proposed Chain Code
• Experimental Results
• Comparisons
• Comments

3
Applications
Object detection
Cartoon Image
Record the region by pixel positions
(x1,y1), (x2,y2), , (xn,yn)
4
FreemanChain Code

• Record the first position and
• the directions of the next pixels

(0,2), 5, 7, 6, 7, 1, 1, 2, 3, 4, 4
5
A Property of Chain Code

• Mostly forward
• Suitable for Huffman Code Compression

6
The Proposed Chain Code

• Record the first position and
• the relative directions of the next pixels

7
Experimental Results
8
Comparisons

• Fixed-length code
• FCCED 3 bits/code
• FCCFD and VCC 2 bits/code
• Variable-length code