Fast computation of a contrast-invariant image representation
- 1 May 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 9 (5) , 860-872
- https://doi.org/10.1109/83.841532
Abstract
This paper sets out a new representation of an image which is contrast independent. The image is decomposed into a tree of "shapes" based on connected components of level sets, which provides a full and nonredundant representation of the image. A fast algorithm to compute the tree, the fast level lines transform (FLLT), is explained in detail. Some simple and direct applications of this representation are shown.Keywords
This publication has 18 references indexed in Scilit:
- A Topological Description of the Topographic MapLecture Notes in Mathematics, 2009
- A partial differential equation approach to image zoomPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Scale-space filtering: A new approach to multi-scale descriptionPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Contrast invariant registration of imagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1999
- On parameter-dependent connected components of gray imagesPattern Recognition, 1996
- Geometry-Driven Diffusion in Computer VisionPublished by Springer Nature ,1994
- Axioms and fundamental equations of image processingArchive for Rational Mechanics and Analysis, 1993
- The structure of imagesBiological Cybernetics, 1984
- On connectivity properties of grayscale picturesPattern Recognition, 1983
- Untersuchungen zur Lehre von der Gestalt. IIPsychological Research, 1923