Fast computation of a contrast-invariant image representation

Citation
P. Monasse et F. Guichard, Fast computation of a contrast-invariant image representation, IEEE IM PR, 9(5), 2000, pp. 860-872
Citations number
29
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEEE TRANSACTIONS ON IMAGE PROCESSING
ISSN journal
10577149 → ACNP
Volume
9
Issue
5
Year of publication
2000
Pages
860 - 872
Database
ISI
SICI code
1057-7149(200005)9:5<860:FCOACI>2.0.ZU;2-1
Abstract
This paper sets out a new representation of an image which is contra;st ind ependent. The image is decomposed into a tree of "shapes" based on connecte d components of level sets, which provides a full and nonredundant represen tation of the image. A fast algorithm to compute the tree, the fast level l ines transform (FLLT), is explained in details. Some simple and direct appl ications of this representation are shown.