Fast computation of a contrast-invariant image representation.
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.
Monasse
P
P
CMLA, Ecole Normale Supérieure de Cachan, 94235 Cachan Cedex, France. monasse@cmla.ens-cachan.fr
Guichard
F
F