Share Email Print

Proceedings Paper

Fast piecewise-constant approximation of images
Author(s): Hayder Radha; Martin Vetterli; Riccardo Leonardi
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this work, we present a Least-Square-Error (LSE), recursive method for generating piecewise -con stant approximations of images. The method is developed using an optimization approach to minimize a cost function. The cost function, proposed here, is based on segmenting the image, recursively, using Binary Space Partitionings (BSPs) of the image domain. We derive a LSE necessary condition for the optimum piece wise-constant approximation, and use this condition to develop an algorithm for generating the LSE, BSP-based approximation. The proposed algorithm provides a significant reduction in the computational expense when compared with a brute force method. As shown in the paper, the LSE algorithm generates efficient segmentations of simple as well as complex images. This shows the potential of the LSE approximation approach for image coding applications. Moreover, the BSP-based segmentation provides a very simple (yet flexible) description of the regions resulting from the partitioning. This makes the proposed approximation method useful for performing image affine transformations (e.g., rotation and scaling) which are common in computer graphics applications.

Paper Details

Date Published: 1 November 1991
PDF: 12 pages
Proc. SPIE 1605, Visual Communications and Image Processing '91: Visual Communication, (1 November 1991); doi: 10.1117/12.50284
Show Author Affiliations
Hayder Radha, AT&T Bell Labs. and Columbia Univ. (United States)
Martin Vetterli, Columbia Univ. (Switzerland)
Riccardo Leonardi, AT&T Bell Labs. (Italy)

Published in SPIE Proceedings Vol. 1605:
Visual Communications and Image Processing '91: Visual Communication
Kou-Hu Tzou; Toshio Koga, Editor(s)

© SPIE. Terms of Use
Back to Top