Linear Time Illumination Invariant Stereo Matching

This paper proposes a new similarity measure that is invariant to global and local affine illumination changes. Unlike existing methods, its computational complexity is very low. When used for stereo correspondence estimation, its computational complexity is linear in the number of image pixels and disparity searching range. It also outperforms the current state of the art similarity measures in terms of accuracy on the Middlebury benchmark (with radiometric differences).