[1]FREEMAN H. On the encoding of arbitrary geometric configurations[J]. IRE Transactions on Electronic Computers, 1961, 10(2):260-268.
[2]LIU Y. Research on the compression algorithm for Freeman chain code [J].Chinese Journal of Computers, 2001, 24(12): 1294-1298.(刘勇奎. Freeman 链码压缩算法的研究[J].计算机学报, 2001, 24(12): 1294-1298.)
[3]LIU Y, ALIK B, WANG P, et al. Directional difference chain codes with quasi-lossless compression and run-length encoding[J]. Signal Processing: Image Communication, 2012, 27(9): 973-984.
[4]ZAHIR S, DHOU K. A new chain coding based method for binary image compression and reconstruction[C/OL].[2014-06-20]. http://www.docin.com/p-173279776.html&endPro=true.
[5]SNCHEZ-CRUZ H, RODRIGUEZ-DIAZ M A. Coding long contour shapes of binary objects[M].Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications. Berlin: Springer , 2009: 45-52.
[6]SNCHEZ-CRUZ H, BRIBIESCA E, RODRIGUEZ-DAGNINO R M. Efficiency of chain codes to represent binary objects[J]. Pattern Recognition, 2007, 40(6): 1660-1674.
[7]LI L, LIU Y. Study on methods for improving compressibility of 4-direction Freeman chain code[J]. Computer Engineering and Design, 2013, 34(3): 1132-1136. (李灵华, 刘勇奎. Freeman 四方向链码压缩率提高的方法研究[J]. 计算机工程与设计, 2013, 34(3): 1132-1136.)
[8]BRIBIESCA E. A new chain code[J]. Pattern Recognition, 1999, 32(2):235-251.
[9]BRIBIESCA E, GUZMAN A. How to describe pure form and how to measure differences in shapes using shape numbers[J]. Pattern Recognition, 1980, 12(1):101-112.
[10]LIU Y, WEI W, WANG P, et al. Compressed vertex chain codes[J]. Pattern Recognition, 2007, 40(11): 2908-2913.
[11]LIU Y, WEI W, GUO H. Compressed vertex chain codes[J]. Chinese Journal of Computers, 2007, 30(2): 281-287. (刘勇奎, 魏巍, 郭禾. 压缩链码的研究[J]. 计算机学报, 2007, 30(2): 281-287.)
[12]LIU Y, HE L, PENG J, et al. Lossless geometry compression through changing 3D coordinates into 1D[J]. International Journal of Advanced Robotic Systems, 2013,10:1-7. |