CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Illumination Invariant Data Cost using Modified Census Transform

Published on February 2014 by Raghavendra U, Krishnamoorthi Makkithaya, Karunakar A. K.
journal_cover_thumbnail

National Conference on Recent Advances in Information Technology
Foundation of Computer Science USA
NCRAIT - Number 2
February 2014
Authors: Raghavendra U, Krishnamoorthi Makkithaya, Karunakar A. K.
96e8cc00-3759-4a90-80aa-5fa42562a699

Raghavendra U, Krishnamoorthi Makkithaya, Karunakar A. K. . Illumination Invariant Data Cost using Modified Census Transform. National Conference on Recent Advances in Information Technology. NCRAIT, 2 (February 2014), 38-41.

@article{
author = { Raghavendra U, Krishnamoorthi Makkithaya, Karunakar A. K. },
title = { Illumination Invariant Data Cost using Modified Census Transform },
journal = { National Conference on Recent Advances in Information Technology },
issue_date = { February 2014 },
volume = { NCRAIT },
number = { 2 },
month = { February },
year = { 2014 },
issn = 0975-8887,
pages = { 38-41 },
numpages = 4,
url = { /proceedings/ncrait/number2/15150-1417/ },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Proceeding Article
%1 National Conference on Recent Advances in Information Technology
%A Raghavendra U
%A Krishnamoorthi Makkithaya
%A Karunakar A. K.
%T Illumination Invariant Data Cost using Modified Census Transform
%J National Conference on Recent Advances in Information Technology
%@ 0975-8887
%V NCRAIT
%N 2
%P 38-41
%D 2014
%I International Journal of Computer Applications
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
  1. 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.
  2. 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.
  3. 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.
  4. 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.
  5. 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.
  6. A. S. Ogale and Y. Aloimonos, "Robust contrast invariant stereo correspondence," in ICRA USA, 2004, pp. 819–824.
  7. 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.
  8. 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.
  9. R. Zabih and J. Woodfill, "Non-parametric local transforms for computing visual correspondence," in ECCV (2) Sweden,1994, pp. 151–158.
  10. 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.
  11. 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.
  12. 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.
Index Terms

Computer Science
Information Sciences

Keywords

Stereo Matching Radiometric Difference And Computer Vision