Fast computation of a contrast-invariant image representation
This paper sets out a new representation of an image which is contra;st 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 details. Some simple and direct applications of this representation are shown.
image representation contrast invariance image coding mathematical morphology