Mathematical definition and analysis of the Retinex algorithm

We present a detailed mathematical analysis of the original Retinex algorithm due to Land and McCann [J. Opt. Soc. Am.61, 1 (1071)]. To this end, we propose an analytic formula that describes the algorithm behavior. More than one Retinex version (e.g., with and without threshold) is examined. The behavior of Retinex varying the number of paths is predicted, and its recursive iterations are mathematically analyzed using the formula. The mathematical setting presented serves as a common ground for the various Retinex implementations. Its validity is confirmed by the tests on images that we have performed.