Image Analysis Using Multigrid Relaxation Methods
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Variational Framework for Retinex
International Journal of Computer Vision
Recovering Shading from Color Images
ECCV '92 Proceedings of the Second European Conference on Computer Vision
ACM SIGGRAPH 2003 Papers
A Perceptually Inspired Variational Framework for Color Enhancement
IEEE Transactions on Pattern Analysis and Machine Intelligence
Issues About Retinex Theory and Contrast Enhancement
International Journal of Computer Vision
Color Constancy
Properties and performance of a center/surround retinex
IEEE Transactions on Image Processing
Shape preserving local histogram modification
IEEE Transactions on Image Processing
High dynamic range image rendering with a retinex-based adaptive filter
IEEE Transactions on Image Processing
Random Spray Retinex: A New Retinex Implementation to Investigate the Local Properties of the Model
IEEE Transactions on Image Processing
Perceptual Color Correction Through Variational Techniques
IEEE Transactions on Image Processing
A Total Variation Model for Retinex
SIAM Journal on Imaging Sciences
| Hi-index | 0.01 |
In 1964, Edwin H. Land formulated the Retinex theory, the first attempt to simulate and explain how the human visual system perceives color. His theory and an extension, the "reset Retinex" were further formalized by Land and McCann [1]. Several Retinex algorithms have been developed ever since. These color constancy algorithms modify the RGB values at each pixel to give an estimate of the color sensation without a priori information on the illumination. Unfortunately, the Retinex Land-McCann original algorithm is both complex and not fully specified. Indeed, this algorithm computes at each pixel an average of a very large set of paths on the image. For this reason, Retinex has received several interpretations and implementations which, among other aims, attempt to tune down its excessive complexity. In this paper, it is proved that if the paths are assumed to be symmetric random walks, the Retinex solutions satisfy a discrete Poisson equation. This formalization yields an exact and fast implementation using only two FFTs. Several experiments on color images illustrate the effectiveness of the Retinex original theory.