Illumination-Invariant Tracking via Graph Cuts

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.

• Type: Conference
• Year: 2005
• Where: CVPR
• Authors: Daniel Freedman, Matthew W. Turek
• Keywords: Computer Vision, CVPR 2005, Density Based Trackers, Graph Cuts Formulation, Illumination Changes