[1] FREEMAN H. On the encoding of arbitrary geometric configurations[J]. IRE Transactions on Electronic Computers, 1961, EC-10(2):260-268. [2] BRIBIESCA E. A new chain code[J]. Pattern Recognition, 1999, 32(2):235-251. [3] SANCHEZ-CRUZ H, BRIBIESCA E, RODRIGUEZ-DAGNINO R M. Efficiency of chain codes to represent binary objects[J]. Pattern Recognition, 2007, 40(6):1660-1674. [4] 刘勇奎.Freeman链码压缩算法的研究[J].计算机学报,2001,24(12):1294-1298.(LIU Y K. Research on the compression algorithm for Freeman chain code[J]. Chinese Journal of Computers, 2001, 24(12):1294-1298.) [5] ZAHIR S, DHOU K. A new chain coding based method for binary image compression and reconstruction[EB/OL]. [2016-10-20]. http://www.eurasip.org/Proceedings/Ext/PCS2007/defevent/papers/cr1221.pdf. [6] 李灵华,刘勇奎.Freeman 四方向链码压缩率提高的方法研究[J].计算机工程与设计,2013,34(3):1132-1136.(LI L H, LIU Y K. Study on methods for improving compressibility of 4-direction Freeman chain code[J]. Computer Engineering and Design, 2013, 34(3):1132-1136.) [7] SANCHEZ-CRUZ H, RODRIGUEZ-DIAZ M A. Coding long contour shapes of binary objects[C]//Proceedings of the 2009 14th Iberoamerican Conference on Pattern Recognition, Image Analysis, Computer Vision, and Applications, LNCS 5856. Berlin:Springer, 2009:45-52. [8] LIU Y K, WEI W, WANG P J, et al. Compressed vertex chain codes[J]. Pattern Recognition, 2007, 40(11):2908-2913. [9] 魏巍,刘勇奎,段晓东,等.基于Huffman编码的改进压缩链码[J].计算机应用,2014,34(12):3565-3569.(WEI W, LIU Y K, DUAN X D, et al. Improved compression vertex chain code based on Huffman coding[J]. Journal of Computer Applications, 2014, 34(12):3565-3569.) [10] ŽALIK B, MONGUS D, LUKACN. A universal chain code compression method[J]. Journal of Visual Communication & Image Representation, 2015, 29(C):8-15. [11] ŽALIK B, MONGUS D, ŽALIK K R, et al. Chain code compression using string transformation techniques[J]. Digital Signal Processing, 2016, 53(C):1-10. [12] 刘勇奎,魏巍,郭禾.压缩链码的研究[J].计算机学报,2007,30(2):281-287.(LIU Y K, WEI W, GUO H. Research on compressed chain code[J]. Chinese Journal of Computers, 2007, 30(2):281-287.) |