Efficient way of coding arbitrary geometric partition for region-based video sequence coding
Stéphane Pateux, Claude Labit · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1997
This article deals with the coding of segmentation maps used in region-based video coding. The scheme proposed to code these maps is based on an efficient edge representation using a graph of contours. Lossless and lossy compressions are then applied in order to have the cheapest representation. Lossless compression is based on Freeman chain-code associated to arithmetic coding, lossy compression is based on polygonal approximation of the contours controlled y a minimum description length criterion. We compare these two encoding schemes applied to different sequences and initial segmentation maps, 1.3 bits per contour points and 0.5 bits per contour points are obtained. Some discussions are also proposed to optimize the segmentation map and its accuracy.