Paper
30 October 2009 Research on compression and improvement of vertex chain code
Guofang Yu, Yujie Zhang
Author Affiliations +
Proceedings Volume 7495, MIPPR 2009: Automatic Target Recognition and Image Analysis; 749556 (2009) https://doi.org/10.1117/12.833601
Event: Sixth International Symposium on Multispectral Image Processing and Pattern Recognition, 2009, Yichang, China
Abstract
Combined with the Huffman encoding theory, the code 2 with highest emergence-probability and continution-frequency is indicated by a binary number 0,the combination of 1 and 3 with higher emergence-probability and continutionfrequency are indicated by two binary number 10,and the corresponding frequency-code are attached to the two kinds of code,the length of the frequency-code can be assigned beforehand or adaptive automatically,the code 1 and 3 with lowest emergence-probability and continution-frequency are indicated by the binary number 110 and 111 respectively.The relative encoding efficiency and decoding efficiency are supplemented to the current performance evaluation system of the chain code.the new chain code is compared with a current chain code through the test system progamed by VC++, the results show that the basic performances of the new chain code are significantly improved, and the performance advantages are improved with the size increase of the graphics.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Guofang Yu and Yujie Zhang "Research on compression and improvement of vertex chain code", Proc. SPIE 7495, MIPPR 2009: Automatic Target Recognition and Image Analysis, 749556 (30 October 2009); https://doi.org/10.1117/12.833601
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Computer programming

Binary data

Visualization

Voltage controlled current source

Computing systems

Image compression

Bismuth

Back to Top