21 April 1995 Coding of arbitrarily shaped regions
Author Affiliations +
Proceedings Volume 2501, Visual Communications and Image Processing '95; (1995) https://doi.org/10.1117/12.206718
Event: Visual Communications and Image Processing '95, 1995, Taipei, Taiwan
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.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
John G. Apostolopoulos, John G. Apostolopoulos, Jae S. Lim, Jae S. Lim, } "Coding of arbitrarily shaped regions", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); doi: 10.1117/12.206718; https://doi.org/10.1117/12.206718
PROCEEDINGS
14 PAGES


SHARE
Back to Top