Coding of arbitrarily shaped regions

John G. Apostolopoulos; Jae S. Lim

doi:10.1117/12.206718

21 April 1995 Coding of arbitrarily shaped regions

John G. Apostolopoulos, Jae S. Lim

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.

Citation Download Citation

John G. Apostolopoulos and Jae S. Lim "Coding of arbitrarily shaped regions", Proc. SPIE 2501, Visual Communications and Image Processing '95, (21 April 1995); https://doi.org/10.1117/12.206718

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available