HIGHLY EFFICIENT CODING SCHEMES FOR CONTOUR LINES BASED ON CHAIN CODE REPRESENTATIONS

被引:47
作者
LU, CC [1 ]
DUNHAM, JG [1 ]
机构
[1] SO METHODIST UNIV,DEPT ELECT ENGN,DALLAS,TX 75275
关键词
Codes; Symbolic - Encoding - Computer Simulation - Probability;
D O I
10.1109/26.103046
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Highly efficient coding schemes for contour line drawings based on chain code representations are proposed. The encoding schemes utilize the first- and second-order Markov models to describe the source structure. Two coding techniques, Huffman encoding and arithmetic encoding, are employed to achieve a high coding efficiency. Universal code tables which match the statistics of contour line drawings obtained from 64 contour maps are presented and can be applied to encode all contour line drawings with chain code representations. Experiments have shown about a 50% improvement on the code amount over the conventional chain encoding scheme with arithmetic coding schemes, and also have shown a comparable compression rate to that obtained by Kaneko and Okudaira with Huffman coding schemes while the implementation is substantially simpler.
引用
收藏
页码:1511 / 1514
页数:4
相关论文
共 13 条
[1]  
Freeman H., 1974, Computing Surveys, V6, P57, DOI 10.1145/356625.356627
[2]  
Freeman H., 1961, IRE T ELECTRON COMPU, VEC- 10, P260, DOI DOI 10.1109/TEC.1961.5219197
[3]  
FREEMAN H, 1978, MAY P IEEE COMP SOC, P220
[4]  
HAMMING RW, 1979, CODING INFORMATION T
[5]   A METHOD FOR THE CONSTRUCTION OF MINIMUM-REDUNDANCY CODES [J].
HUFFMAN, DA .
PROCEEDINGS OF THE INSTITUTE OF RADIO ENGINEERS, 1952, 40 (09) :1098-1101
[6]   ENCODING OF ARBITRARY CURVES BASED ON THE CHAIN CODE REPRESENTATION [J].
KANEKO, T ;
OKUDAIRA, M .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1985, 33 (07) :697-707
[7]  
Pasco R. C., 1976, THESIS STANFORD U ST
[8]  
Pavlidis T., 1982, ALGORITHMS GRAPHICS
[9]  
Pratt W. K., 1978, DIGITAL IMAGE PROCES
[10]  
RISSANEN J, 1975, IBM RES REP