Share Email Print

Proceedings Paper

Coding of arbitrarily shaped regions
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Region-based coding schemes may yield considerable improvements in performance as compared to block-based schemes. A fundamental problem in region-based coding is to efficiently encode the interior of each region. This paper proposes two approaches for coding the interiors of arbitrarily-shaped regions. The first is an adaptive iterative scheme and the second is a matching pursuits-type scheme. A geometric interpretation of the problem is given to provide insight into these approaches and to compare their different properties and performances. A number of examples illustrate the performance of the previous and proposed approaches.

Paper Details

Date Published: 21 April 1995
PDF: 14 pages
Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); doi: 10.1117/12.206718
Show Author Affiliations
John G. Apostolopoulos, Massachusetts Institute of Technology (United States)
Jae S. Lim, Massachusetts Institute of Technology (United States)

Published in SPIE Proceedings Vol. 2501:
Visual Communications and Image Processing '95
Lance T. Wu, 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?