Peak-tree: a new approach to image simplification

Sukhamay Kundu

doi:10.1117/12.364103

Abstract

We define a peak of an image I at the grey level g to be a connected region of pixels p_ij with the grey values g(p_ij) 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).

Citation Download Citation

Sukhamay Kundu, Sukhamay Kundu, } "Peak-tree: a new approach to image simplification", Proc. SPIE 3811, Vision Geometry VIII, (23 September 1999); doi: 10.1117/12.364103; https://doi.org/10.1117/12.364103

ACCESS THE FULL ARTICLE

PERSONAL SIGN IN
Full access may be available with your subscription

Email or Username Forgot your username?

Password Forgot your password?

Show

Remember Email/Username on this computer

Remember Password

No SPIE account? Create an account
or Institutional Sign In via Shibboleth

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

Members: $14.40

Non-members: $18.00 ADD TO CART

Show All Keywords

Keywords/Phrases

Search In:

Publication Years