2007
DOI: 10.1016/j.patrec.2007.03.007
|View full text |Cite
|
Sign up to set email alerts
|

Robust template tracking with drift correction

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
48
0

Year Published

2010
2010
2021
2021

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 41 publications
(48 citation statements)
references
References 11 publications
0
48
0
Order By: Relevance
“…Hence, lighting and other gradual changes are represented by the technique. Schreiber 14 provides an extension to Matthews' work. The next section presents the experimental results and discussion.…”
Section: Appearance Modelmentioning
confidence: 99%
“…Hence, lighting and other gradual changes are represented by the technique. Schreiber 14 provides an extension to Matthews' work. The next section presents the experimental results and discussion.…”
Section: Appearance Modelmentioning
confidence: 99%
“…These robust tracking algorithms can be regarded as a weighted least square process, such that occluded regions, background pixels and regions where brightness has changed would be considered as outliers and would be suppressed (Schreiber, 2007). However, these algorithms require a trade-off between efficiency and accuracy.…”
Section: Introductionmentioning
confidence: 99%
“…In case the difference between the two templates is persistent over a number of frames, the drift builds up just as with the case of the naive strategy. A recent work [13] proposed a robust drift-correcting template matching method. It adapts the inverse compositional algorithm [14] by adding robust weights to the least square solution and the Hessian matrix; the adapted inverse compositional algorithm is used to track the current frame first with the current template and then with the first template.…”
Section: Introductionmentioning
confidence: 99%
“…A shortcoming of the method is that it uses a single transformation model (e.g., a rigid transformation model for computation efficiency) to describe the template deformations through the tracking, which is generally insufficient as the template might undergo complex or non-rigid deformations. Also, the adapted inverse compositional algorithm method is 40% slower on average than the original inverse compositional algorithm [13].…”
Section: Introductionmentioning
confidence: 99%