TY - JOUR
T1 - Visual tracking based on extreme learning machine and sparse representation
AU - Wang, Baoxian
AU - Tang, Linbo
AU - Yang, Jinglin
AU - Zhao, Baojun
AU - Wang, Shuigen
N1 - Publisher Copyright:
© 2015 by the authors; licensee MDPI, Basel, Switzerland.
PY - 2015/10/22
Y1 - 2015/10/22
N2 - The existing sparse representation-based visual trackers mostly suffer from both being time consuming and having poor robustness problems. To address these issues, a novel tracking method is presented via combining sparse representation and an emerging learning technique, namely extreme learning machine (ELM). Specifically, visual tracking can be divided into two consecutive processes. Firstly, ELM is utilized to find the optimal separate hyperplane between the target observations and background ones. Thus, the trained ELM classification function is able to remove most of the candidate samples related to background contents efficiently, thereby reducing the total computational cost of the following sparse representation. Secondly, to further combine ELM and sparse representation, the resultant confidence values (i.e., probabilities to be a target) of samples on the ELM classification function are used to construct a new manifold learning constraint term of the sparse representation framework, which tends to achieve robuster results. Moreover, the accelerated proximal gradient method is used for deriving the optimal solution (in matrix form) of the constrained sparse tracking model. Additionally, the matrix form solution allows the candidate samples to be calculated in parallel, thereby leading to a higher efficiency. Experiments demonstrate the effectiveness of the proposed tracker.
AB - The existing sparse representation-based visual trackers mostly suffer from both being time consuming and having poor robustness problems. To address these issues, a novel tracking method is presented via combining sparse representation and an emerging learning technique, namely extreme learning machine (ELM). Specifically, visual tracking can be divided into two consecutive processes. Firstly, ELM is utilized to find the optimal separate hyperplane between the target observations and background ones. Thus, the trained ELM classification function is able to remove most of the candidate samples related to background contents efficiently, thereby reducing the total computational cost of the following sparse representation. Secondly, to further combine ELM and sparse representation, the resultant confidence values (i.e., probabilities to be a target) of samples on the ELM classification function are used to construct a new manifold learning constraint term of the sparse representation framework, which tends to achieve robuster results. Moreover, the accelerated proximal gradient method is used for deriving the optimal solution (in matrix form) of the constrained sparse tracking model. Additionally, the matrix form solution allows the candidate samples to be calculated in parallel, thereby leading to a higher efficiency. Experiments demonstrate the effectiveness of the proposed tracker.
KW - Accelerated proximal gradient
KW - Extreme learning machine
KW - Manifold learning
KW - Sparse representation
KW - Visual tracking
UR - http://www.scopus.com/inward/record.url?scp=84948135774&partnerID=8YFLogxK
U2 - 10.3390/s151026877
DO - 10.3390/s151026877
M3 - Article
AN - SCOPUS:84948135774
SN - 1424-8220
VL - 15
SP - 26877
EP - 26905
JO - Sensors
JF - Sensors
IS - 10
ER -