Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-18T00:48:08.287Z Has data issue: false hasContentIssue false

The tree of shapes of an image

Published online by Cambridge University Press:  15 September 2003

Coloma Ballester
Affiliation:
Univ. Pompeu-Fabra, Passeig de Circumvalació 8, 08003 Barcelona, Spain; coloma.ballester@tecn.upf.es. vicent.caselles@tecn.upf.es.
Vicent Caselles
Affiliation:
Univ. Pompeu-Fabra, Passeig de Circumvalació 8, 08003 Barcelona, Spain; coloma.ballester@tecn.upf.es. vicent.caselles@tecn.upf.es.
P. Monasse
Affiliation:
CMLA, ENS Cachan, 61 avenue du Président Wilson, 94235 Cachan Cedex, France; monasse@cmla.ens-cachan.fr.
Get access

Abstract

In [CITE], Kronrod proves that the connected components of isolevelsets of a continuous function can be endowed with a treestructure. Obviously, the connected components of upper level sets are aninclusion tree, and the same is true for connected components of lower levelsets. We prove that in the case of semicontinuous functions, those trees canbe merged into a single one, which, following its use in image processing, wecall “tree of shapes”. This permits us to solve a classical representationproblem in mathematical morphology: to represent an image in such a way thatmaxima and minima can be computationally dealt with simultaneously. We provethe finiteness of the tree when the image is the result of applying anyextrema killer (a classical denoising filter in image processing). The shapetree also yields an easy mathematical definition of adaptive imagequantization.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2003

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable