Title :
Illumination-invariant tracking via graph cuts
Author :
Freedman, Daniel ; Turek, Matthew W.
Author_Institution :
Dept. of Comput. Sci., Rensselaer Polytech. Inst., Troy, NY, USA
Abstract :
Illumination changes are a ubiquitous problem in computer vision. They present a challenge in many applications, including tracking: for example, an object may move in and out of a shadow. We present a new tracking algorithm which is insensitive to illumination changes, while at the same time using all of the available photometric information. The algorithm is based on computing an illumination-invariant optical flow field; the computation is made robust by using a graph cuts formulation. Experimentally, the new technique is shown to quite reliable in both synthetic and real sequences, dealing with a variety of illumination changes that cause problems for density based trackers.
Keywords :
computer vision; graph theory; image sequences; lighting; photometry; tracking; ubiquitous computing; computer vision; graph cuts; illumination changes; illumination-invariant tracking algorithm; optical flow field; photometric information; real sequences; ubiquitous phenomenon; Application software; Computer vision; Image motion analysis; Lighting; Optical computing; Optical sensors; Optical variables control; Photometry; Robustness; Tracking; graph cuts; illumination invariance; optical flow; tracking;
Conference_Titel :
Computer Vision and Pattern Recognition, 2005. CVPR 2005. IEEE Computer Society Conference on
Print_ISBN :
0-7695-2372-2
DOI :
10.1109/CVPR.2005.182