Share Email Print

Proceedings Paper

Efficient way of coding arbitrary geometric partition for region-based video sequence coding
Author(s): Stephane Pateux; Claude Labit
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 10 January 1997
PDF: 12 pages
Proc. SPIE 3024, Visual Communications and Image Processing '97, (10 January 1997); doi: 10.1117/12.263286
Show Author Affiliations
Stephane Pateux, IRISA/INRIA-Rennes (France)
Claude Labit, IRISA/INRIA-Rennes (France)

Published in SPIE Proceedings Vol. 3024:
Visual Communications and Image Processing '97
Jan Biemond; Edward J. Delp III, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?