Illumination Invariant Data Cost using Modified Census Transform
Raghavendra U, Krishnamoorthi Makkithaya and Karunakar A K.. Article: Illumination Invariant Data Cost using Modified Census Transform. IJCA Proceedings on National Conference on Recent Advances in Information Technology NCRAIT(2):38-41, February 2014. Full text available. BibTeX
@article{key:article,
author = {Raghavendra U and Krishnamoorthi Makkithaya and Karunakar A. K.},
title = {Article: Illumination Invariant Data Cost using Modified Census Transform},
journal = {IJCA Proceedings on National Conference on Recent Advances in Information Technology},
year = {2014},
volume = {NCRAIT},
number = {2},
pages = {38-41},
month = {February},
note = {Full text available}
}
Abstract
Stereo matching in non-ideal illumination is a challenging area of research. It assumes identical corresponding color values and this assumption is not guaranteed for real-time environment. As a result most of the stereo algorithms fail to generate good disparity. This paper proposes a Modified Census Correlation (MCC) data cost for stereo matching. The proposed data cost will be derived from modified census transformed indexed image and it is robust to change in lighting direction, exposure and illumination color. The obtained total energy is optimized for disparity estimation using Graph-Cut. An exhaustive evaluation using Middlebury stereo image proves the robustness of the proposed technique for variety of illumination and exposure conditions.
References
- H. Hirschmuller and D. Scharstein, "Evaluation of stereo matching costs on images with radiometric differences," IEEETransactions on Pattern Analysis and Machine Intelligence,vol. 31, no. 9, pp. 1582–1599, 2009.
- D. Scharstein and R. Szeliski, "A taxonomy and evaluation ofdense two-frame stereo correspondence algorithms," Journal of Computer Vision, vol. 47, no. 1-3, pp. 7–42, 2001.
- Raghavendra U, KrishnamoorthiMakkithaya, Karunakar A. K,Qualitative and Quantitative Evaluation of Correlation Based StereoMatching Algorithms, Lecture Notes in Computer Science, SpringerBerlin/Heidelberg, International Conference on Advanced Computing,Networking and Security, pp. 242- 252, 16th Dec 2011, NITK,Surathkal.
- O. Faugeras, B. Hotz, H. Mathieu, T. Viville, Z. Zhang, P. Fua, E. Thron, and P. Robotvis, "Real time correlationbased stereo: Algorithm, implementations and applications," Technical Report RR-2013 INRIA, 1996.
- Y. S. Heo, K. M. Lee, and S. U. Lee, "Robust stereo matchingusing adaptive normalized cross-correlation", IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 33, no. 4, pp. 807–822, 2011.
- A. S. Ogale and Y. Aloimonos, "Robust contrast invariant stereo correspondence," in ICRA USA, 2004, pp. 819–824.
- Z. Xu, L. Ma, M. Kimachi, and M. Suwa, "Efficient contrastinvariant stereo correspondence using dynamic programmingwith vertical constraint," Vis. Comput. , vol. 24, no. 1, pp. 45–55, Nov. 2007.
- Y. Boykov, O. Veksler, and R. Zabih, "Fast approximate energy minimization via graph cuts," IEEETransactions on Pattern Analysis and Machine Intelligence, vol. 23, no. 11, pp. 1222–1239, Nov. 2001.
- R. Zabih and J. Woodfill, "Non-parametric local transforms for computing visual correspondence," in ECCV (2) Sweden,1994, pp. 151–158.
- C. Kublbeck and A. Ernst, "Face detection and tracking in video sequences using the modifiedcensus transformation," Image and Vision Computing, vol. 24, no. 6, pp. 564–572,2006.
- S. Birchfield and C. Tomasi, "A pixel dissimilarity measurethat is insensitive to image sampling," IEEE Transactions onPattern Analysis and Machine Intelligence, vol. 20, no. 4, pp. 401–406, 1998.
- R. Szeliski, R. Zabih, D. Scharstein, O. Veksler, V. Kolmogorov, A. Agarwala, M. Tappen, and C. Rother, "A comparative study of energy minimization methods for markov random fields with smoothness-based priors,"IEEETransactions on Pattern Analysis and Machine Intelligence, vol. 30, no. 6, pp. 1068-1080, 2008.