Boundary representation techniques for object-based image compression

Mark S. Schmalz; Gerhard X. Ritter

doi:10.1117/12.508004

28 January 2004 Boundary representation techniques for object-based image compression

Mark S. Schmalz, Gerhard X. Ritter

Author Affiliations +

Proceedings Volume 5208, Mathematics of Data/Image Coding, Compression, and Encryption VI, with Applications; (2004) https://doi.org/10.1117/12.508004
Event: Optical Science and Technology, SPIE's 48th Annual Meeting, 2003, San Diego, California, United States

Abstract

As digital image and video compression technology evolves, it appears that transform based coding or compression techinques will reach asymptotic rate-distortion performance, especially with respect to linear transforms. Although nonlinear compression techniques (for example, based on Markov models) are being developed, progress has been relatively slow due to challenges in theory development. Alternatively, several research teams have produced algorithms for object-based compression (OBC), whereby an image is segmented into areas of similar color or spatial variance. Each segmented region can then be represented in terms of a small region descriptor and somewhat less compact set of boundary descriptors. This paper examines boundary representations and complexity measures for OBC - a previous publication, also related to OBC, overviewed region segmentation techniques. Of particular interest to OBC is the evolution of boundary representations from early approaches such as chain coding or simplical complexes to transform coded descriptors such as Fourier or wavelet-based representations. These techniques precede more modern methods such as hierarchical transforms (e.g., wavelets) and direct compression of Boolean boundary representations. In this paper, the authors develop boundary compression algorithms based on concepts derived from statistical image compression theory and hierarchical codebook representations. The resulting boundary encoding technique is suitable for a wide range of compression applications, in particular, OBC. Performance criteria include computational complexity of the encoding process, as well as space complexity of intermediate and final boundary representations.

Citation Download Citation

Mark S. Schmalz and Gerhard X. Ritter "Boundary representation techniques for object-based image compression", Proc. SPIE 5208, Mathematics of Data/Image Coding, Compression, and Encryption VI, with Applications, (28 January 2004); https://doi.org/10.1117/12.508004

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