Fast computation of a contrast-invariant image representation

By Pascal Monasse, Frédéric Guichard. IEEE Transactions on Image Processing, 2000

389 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Survey on Spectral–Spatial Classification Techniques Based on Attribute Profiles (2015, background): “, considered as “holes”), and the connections in the tree are determined by the considered region-filling operator [39].”
On the set of images modulo viewpoint and contrast changes (2009, background): “However, there is a considerable body of literature [1, 15, 3] 5 dealing with more restricted illumination models that induce a monotonic continuous transformation of the image intensities, a.”
Digital Topology and Geometry in Medical Imaging: A Survey (2015, methodology): “An inclusion tree [207] is computed using the inclusion criterion of the borders of bounded components at different thresholds; see Fig.”
Classifying Compound Structures in Satellite Images: A Compressed Representation for Fast Queries (2015, background): “All descriptors can be computed in linear time by exploiting the nesting property encoded into the MinTree [18], [30], [39].”