Adaptive Split-and-Merge for Image Analysis and Coding

R. Leonardi; M. Kunt

doi:10.1117/12.952190

1 May 1986 Adaptive Split-and-Merge for Image Analysis and Coding

R. Leonardi, M. Kunt

Proceedings Volume 0594, Image Coding; (1986) https://doi.org/10.1117/12.952190
Event: 1985 International Technical Symposium/Europe, 1985, Cannes, France

Abstract

An approximation algorithm for two-dimensional (2-D) signals, e.g. images, is presented. This approximation is obtained by partitioning the original signal into adjacent regions with each region being approximated in the least square sense by a 2-D analytical function. The segmentation procedure is controlled iteratively to insure at each step the best possible quality between the original image and the segmented one. The segmentation is based on two successive steps: splitting the original picture into adjacent squares of different size, then merging them in an optimal way into the final region configuration. Some results are presented when the approximation is performed by polynomial functions.

Citation Download Citation

R. Leonardi and M. Kunt "Adaptive Split-and-Merge for Image Analysis and Coding", Proc. SPIE 0594, Image Coding, (1 May 1986); https://doi.org/10.1117/12.952190

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