TY - JOUR
T1 - Tracking nonstationary visual appearances by data-driven adaptation
AU - Yang, Ming
AU - Fan, Zhimin
AU - Fan, Jialue
AU - Wu, Ying
N1 - Funding Information:
Manuscript received June 08, 2008; revised March 03, 2009. First published May 26, 2009; current version published June 12, 2009. This work was supported in part by the National Science Foundation Grant IIS-0347877 and in part by the U.S. Army Research Laboratory and the U.S. Army Research Office under Grant ARO W911NF-08-1-0504. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Xuelong Li.
PY - 2009
Y1 - 2009
N2 - Without any prior about the target, the appearance is usually the only cue available in visual tracking. However, in general, the appearances are often nonstationary which may ruin the predefined visual measurements and often lead to tracking failure in practice. Thus, a natural solution is to adapt the observation model to the nonstationary appearances. However, this idea is threatened by the risk of adaptation drift that originates in its ill-posed nature, unless good data-driven constraints are imposed. Different from most existing adaptation schemes, we enforce three novel constraints for the optimal adaptation: 1) negative data, 2) bottom-up pair-wise data constraints, and 3) adaptation dynamics. Substantializing the general adaptation problem as a subspace adaptation problem, this paper presents a closed-form solution as well as a practical iterative algorithm for subspace tracking. Extensive experiments have demonstrated that the proposed approach can largely alleviate adaptation drift and achieve better tracking results for a large variety of nonstationary scenes.
AB - Without any prior about the target, the appearance is usually the only cue available in visual tracking. However, in general, the appearances are often nonstationary which may ruin the predefined visual measurements and often lead to tracking failure in practice. Thus, a natural solution is to adapt the observation model to the nonstationary appearances. However, this idea is threatened by the risk of adaptation drift that originates in its ill-posed nature, unless good data-driven constraints are imposed. Different from most existing adaptation schemes, we enforce three novel constraints for the optimal adaptation: 1) negative data, 2) bottom-up pair-wise data constraints, and 3) adaptation dynamics. Substantializing the general adaptation problem as a subspace adaptation problem, this paper presents a closed-form solution as well as a practical iterative algorithm for subspace tracking. Extensive experiments have demonstrated that the proposed approach can largely alleviate adaptation drift and achieve better tracking results for a large variety of nonstationary scenes.
KW - Appearance model adaptation
KW - Subspace tracking
KW - Visual tracking
UR - http://www.scopus.com/inward/record.url?scp=67649881131&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=67649881131&partnerID=8YFLogxK
U2 - 10.1109/TIP.2009.2019807
DO - 10.1109/TIP.2009.2019807
M3 - Article
C2 - 19473941
AN - SCOPUS:67649881131
VL - 18
SP - 1633
EP - 1644
JO - IEEE Transactions on Image Processing
JF - IEEE Transactions on Image Processing
SN - 1057-7149
IS - 7
ER -