@InProceedings{freedman:cvpr05,
  author =	 {D.\ Freedman and M.\ W.\ Turek},
  title =	 {Illumination-invariant tracking via graph cuts},
  booktitle =	 {Computer Vision and Pattern Recognition, 2005. CVPR
                  2005. IEEE Computer Society Conference on},
  year =	 2005,
  volume =	 2,
  pages =	 {10--17},
  keywords =	 {computer vision, graph theory, image sequences,
                  lighting, photometry, tracking, ubiquitous
                  computing, graph cuts, illumination changes,
                  illumination-invariant tracking algorithm, optical
                  flow field, photometric information, real sequences,
                  ubiquitous phenomenon, illumination invariance,
                  optical flow},
  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.},
  issn =	 {1063-6919},
  annote =	 {}
}