The segmented vertex chain code

Abstract

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.

Evaluation and Comparison on the Techniques of Vertex Chain Codes

“…Up to now, VC_VCC remains one of the most efficient to compress binary objects. In [22], VC_VCC was further compressed by applying the concept of segment on it.…”