Share Email Print
cover

Proceedings Paper

Peak-tree: a new approach to image simplification
Author(s): Sukhamay Kundu
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We define a peak of an image I at the grey level g to be a connected region of pixels pij with the grey values g(pij) greater than or equal to g. The peaks form a tree structure, called the peak-tree (Pi) (I). It generalizes the notion of the grey-level histogram of I and partially captures the spatial distribution of grey values in the image. Thereby, it opens up new methods for simplifying an image as illustrated here. We give an efficient O(NV) algorithm for constructing the peak-tree, where N equals #(pixels in I) and V equals #(distinct grey levels in I).

Paper Details

Date Published: 23 September 1999
PDF: 11 pages
Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); doi: 10.1117/12.364103
Show Author Affiliations
Sukhamay Kundu, Louisiana State Univ. (United States)


Published in SPIE Proceedings Vol. 3811:
Vision Geometry VIII
Longin Jan Latecki; Robert A. Melter; David M. Mount; Angela Y. Wu, Editor(s)

© SPIE. Terms of Use
Back to Top