Robust tracking and stereo matching under variable illumination

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn 1, Issue , 2006, Pages 871-878

  Zhang, Jingdan ^a   McMillan, Leonard ^a   Yu, Jingyi ^b  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b UNIVERSITY OF DELAWARE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ILLUMINATION RATIO MAP (IRM); MARKOV NETWORK; STEREO MATCHING;

ALGORITHMS; LIGHTING; OPTIMIZATION; PATTERN MATCHING; TRACKING (POSITION);

COMPUTER VISION;

EID: 33845573108     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2006.260     Document Type: Conference Paper

References (20)

1. Y. Boykov, O. Veksler, and R. Zabih. Fast approximate energy minimization via graph cuts. PAMI, 23(11):1222-1239, 2001.
2. H. F. Chen, P. N. Belhumeur, and D. W. Jacob. In Search of Illumination Invariants. ICCV, 254-261, 2000.
3. D. Comaniciu and P. Meer. Mean shift: A robust approach toward feature space analysis. PAMI, 24(5):603-619, 2001.
4. P. F. Felzenszwalb and D. P. Huttenlocher. Efficient belief propagation for early vision. CVPR, Vol 1:261-268, 2004.
5. G. Finlayson, S. Hordley, and M. Drew. Removing shadows from images. ECCV, 2002.
6. D. Freedman and M. W. Turek. Illumination-invariant tracking via graph cuts. CVPR, volume 2, pages 10-17, 2005.
7. D. W. Jacob, P. N. Belhumeur, and R. Basri. Comparing images under variable illumination. CVPR, 610-617, 1998.
8. S.J. Kim, M. Pollefeys. Radiometric Self-Alignment of Image Sequences. CVPR, 2004
9. V. Kolmogorov and R. Zabih. Computing visual correspondence with occlusions using graph cuts. ICCV, pages 508-515, 2001.
10. V. Kolmogorov and R. Zabih. Multi-camera scene reconstruction via graph cuts. ECCV, Vol 111:82-96, 2002.
11. D.Marr and T.A. Poggio. Cooperative computation of stereo disparity. Science, 194(4262):283-287, 1976.
12. Y. Matsushita, K. Nishino, K. Ikeuchi, and S. Masao. Illumination normalization with time-dependent intrinsic images for video surveillance. In CVPR, 2004.
13. D. Scharstein and R. Szeliski. A taxonomy and evaluation of dense two-frame stereo correspondence algorithms. IJCV, 47(1):7-42, 2002.
14. C. Strecha, R. Fransens, and L. Van Gool. Wide-baseline stereo from multiple views: a probabilistic account. CVPR, Vol 1:552-559, 2004.
15. J. Sun, H. Y. Shum, and N. N. Zheng. Stereo matching using belief propagation. ECCV, Vol 11:510-524, 2002.
16. J. Sun, Y. Li, S. B. Kang, and H. Y. Shum. Symmetric stereo matching for occlusion handling. CVPR, Vol II: 399-406, 2005.
17. M. F. Tappen and W. T. Freeman. Comparison of graph cuts with belief propagation for stereo, using identical mrf parameters. ICCV, Vol 11:900-906, 2003.
18. M. F. Tappen, W. T. Freeman, E. H. Adelson. Recovering Intrinsic Images from a Single Image. TPAMI, vol. 27, no. 9, pp. 1459-1472, September, 2005.
19. Y. Weiss. Deriving intrinsic images from image sequences. ICCV, 68-75, 2001
20. Y. Weiss and W. T. Freeman. On the optimality of solutions of the max-product belief propagation algorithm in arbitrary graphs. IEEE Transactions on Information Theory. 47, 2, 723-735.