Contour coding based on the decomposition of line segments

Abstract This paper proposes an information-preserving contour coding scheme based on the decomposition of the original chain code into the smoothed code and its difference code. High data compression can be achieved by applying entropy coding technique to the proposed algorithm. This proposed algorithm using decomposition is combined with the fixed- or variable-length coding schemes to compare its performance to those of the conventional coding algorithms. Since the proposed algorithm is so simple, it can be adopted to other contour coding algorithms for high data compression.

[1]  Joan S. Weszka,et al.  A survey of threshold selection techniques , 1978 .

[2]  Herbert Freeman,et al.  On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..

[3]  Herbert Freeman,et al.  Computer Processing of Line-Drawing Images , 1974, CSUR.

[4]  Azriel Rosenfeld,et al.  A Note on Thinning , 1976, IEEE Transactions on Systems, Man, and Cybernetics.

[5]  Jack Koplowitz,et al.  On bit reduction of chain coded line drawings , 1986, Pattern Recognit. Lett..

[6]  D. Huffman A Method for the Construction of Minimum-Redundancy Codes , 1952 .