Paper
10 January 1997 Efficient way of coding arbitrary geometric partition for region-based video sequence coding
Stephane Pateux, Claude Labit
Author Affiliations +
Proceedings Volume 3024, Visual Communications and Image Processing '97; (1997) https://doi.org/10.1117/12.263286
Event: Electronic Imaging '97, 1997, San Jose, CA, United States
Abstract
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.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Stephane Pateux and Claude Labit "Efficient way of coding arbitrary geometric partition for region-based video sequence coding", Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); https://doi.org/10.1117/12.263286
Lens.org Logo
CITATIONS
Cited by 3 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Image segmentation

Video coding

Switching

Image compression

Video

Computer programming

Quantization

Back to Top