DMCA
Illumination-Invariant Tracking via Graph Cuts (2005)
Cached
Download Links
- [www.cs.rpi.edu]
- [www.cs.rpi.edu]
- [www.vision.cs.rpi.edu]
- [www.cs.rpi.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | IN PROC. OF IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION |
| Citations: | 30 - 0 self |
BibTeX
@INPROCEEDINGS{Freedman05illumination-invarianttracking,
author = {Daniel Freedman and Matthew W. Turek},
title = {Illumination-Invariant Tracking via Graph Cuts},
booktitle = {IN PROC. OF IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION},
year = {2005},
pages = {10--17},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
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.
