2015 IEEE International Conference on Computer Vision (ICCV) 2015
DOI: 10.1109/iccv.2015.350
|View full text |Cite
|
Sign up to set email alerts
|

Tracking-by-Segmentation with Online Gradient Boosting Decision Tree

Abstract: We propose an online tracking algorithm that adaptively models target appearances based on an online gradient boosting decision tree. Our algorithm is particularly useful for non-rigid and/or articulated objects since it handles various deformations of the target effectively by integrating a classifier operating on individual patches and provides segmentation masks of the target as final results. The posterior of the target state is propagated over time by particle filtering, where the likelihood is computed b… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
74
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 115 publications
(74 citation statements)
references
References 31 publications
0
74
0
Order By: Relevance
“…Because it does not require making assumptions on the data, it is extensively used in certain fields, such as in the optimization of recommendation systems [62,63], visual tracking algorithms [64], and traffic systems [65][66][67][68]. The attractiveness of GBRT comes from its ability to deal with the uneven distribution of data attributes, its lack of limitation for any hypothesis of input data, its better predictive capacity than a single decision tree, its power to deal with larger data size, and its transparency in terms of model development.…”
Section: Gradient Boosting Regression Treementioning
confidence: 99%
“…Because it does not require making assumptions on the data, it is extensively used in certain fields, such as in the optimization of recommendation systems [62,63], visual tracking algorithms [64], and traffic systems [65][66][67][68]. The attractiveness of GBRT comes from its ability to deal with the uneven distribution of data attributes, its lack of limitation for any hypothesis of input data, its better predictive capacity than a single decision tree, its power to deal with larger data size, and its transparency in terms of model development.…”
Section: Gradient Boosting Regression Treementioning
confidence: 99%
“…1) Non-rigid Object Tracking: The most recent dataset of non-rigid object tracking [14] includes 11 challenging image sequences with pixel-wise annotations in each frame. The [14]) and seven state-of-the-art bounding box-based trackers (Struck [70], SCM [71], MEEM [72], MUSTer [73], DSMT [28], FCNT [36], and HCFT [37]). These trackers based on hard-crafted [70]- [73] or deep [28], [36], [37] features achieve top performance on recent largescale tracking benchmarks [66].…”
Section: Experimental Results On Visual Trackingmentioning
confidence: 99%
“…Qualitative evaluation of the proposed tracker and other segmentation-based methods. From left to right: (a) input frames; (b) HT [13]; (c) SPT [11]; (d) PT [10]; (e) OGBDT [14]; (f) our method; and (g) ground truth. performance in dealing with traditional saliency detection and visual tracking problems.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Gradient boosting is a highly matured algorithm to update the boosting classifiers online and frequently enhances the exactness of the segmentation [5]. In order to manage the labeling uncertainty for semi-supervised learning and it explains the online gradient boosting technique which depends on the various instance learning.…”
Section: Introductionmentioning
confidence: 99%