Fast computation of a contrast-invariant image representation | IEEE Journals & Magazine | IEEE Xplore

Fast computation of a contrast-invariant image representation


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...Show More

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.
Published in: IEEE Transactions on Image Processing ( Volume: 9, Issue: 5, May 2000)
Page(s): 860 - 872
Date of Publication: 31 May 2000

ISSN Information:

PubMed ID: 18255457

Contact IEEE to Subscribe

References

References is not available for this document.