Abstract
We present here a first algorithm, the Fast Level Sets Transform, that computes the tree of shapes from an input image. Although it is applicable in any dimension, its efficiency relies on specific properties of a dimension 2 domain. Although a direct derivation of the existence of the tree of shapes in the discrete case would be possible, a judicious interpretation of the digital image as a continuous domain image leads us directly in the framework of Chap. 2, hence proving the result. This artifice avoids the necessity of a theory in the discrete case. An open source reference implementation of the algorithm presented in this chapter is freely available in the MegaWave software suite (http://megawave.cmla.ens-cachan.fr, module flst).
Keywords
- Gray Level
- Euler Characteristic
- Break Condition
- Level Line
- Local Extremum
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Caselles, V., Monasse, P. (2010). Computation of the Tree of Shapes of a Digital Image. In: Geometric Description of Images as Topographic Maps. Lecture Notes in Mathematics(), vol 1984. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04611-7_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-04611-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04610-0
Online ISBN: 978-3-642-04611-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)
