Fast computation of a contrast-invariant image representation
Authors:
- P. MonassePMP. Monasse
- F. GuichardFGF. Guichard
- 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
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 16 references indexed in Scilit:
- The 2.1-D sketch2002
- Scale-Space from a Level Lines TreeLecture Notes in Computer Science, 1999
- Contrast invariant registration of images1999
- On parameter-dependent connected components of gray imagesPattern Recognition, 1996
- Geometry-Driven Diffusion in Computer Vision1994
- Axioms and fundamental equations of image processingArchive for Rational Mechanics and Analysis, 1993
- Reconstructions from zero crossings in scale spaceIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- The structure of imagesBiological Cybernetics, 1984
- On connectivity properties of grayscale picturesPattern Recognition, 1983
- Untersuchungen zur Lehre von der Gestalt. IIPsychological Research, 1923