IMAGE-CODING BY ADAPTIVE TREE-STRUCTURED SEGMENTATION

Proposed is a new algorithmic approach to segmentation-based image coding. A good compromise is achieve between segmentations by quadtree-based decomposition and by free region-growing in terms of time complexity and scene adaptability. Encoding is to recursively partition an image into convex n-gons, 3 less-than-or-equal-to n less-than-or-equal-to 8, until the pixels in current n-gon satisfy a uniformity criterion. The recursive partition generates a valid segmentation by aligning the polygon boundaries with image edges. This segmentation is embedded into a binary tree for compact encoding of its geometry. The compressed image is sent as a labeled pointerless binary tree, and decoding is simply polygon filling. High-compression ratios are obtained by balancing the accuracy and geometric complexity of the image segmentation; a key issue for segmentation-based image coding that was not addressed before. Due to its tree structure, the new method is also suitable for progressive image coding.