To decrease the amount of information significantly while still preserving a contour shape, chain coding is widely applied to digital image analysis, especially to raster-shaped ones. In this article, vertex chain code is segmented and then compressed using the single-sided grown Huffman table scheme. Since the length of segments is fixed, the encoding complexity is reduced. According to the experimental results and theoretical analysis, the data compression ratio, exploiting this simple yet efficient segmenting scheme, is competitive with other proposed schemes. The segment length can be appropriately determined according to various contour databases.
|頁（從 - 到）||825-834|
|期刊||Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A|
|出版狀態||Published - 2011 九月|
All Science Journal Classification (ASJC) codes