Fast computation of a contrast-invariant image representation

  • Authors:
  • P. Monasse;F. Guichard

  • Affiliations:
  • Ecole Normale Superieure de Cachan;-

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 2000

Quantified Score

Hi-index 0.01

Visualization

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