@incollection{ zhang_real-time_2012,
  series = {Lecture {Notes} in {Computer} {Science}},
  title = {Real-{Time} {Compressive} {Tracking}},
  copyright = {©2012 Springer-Verlag Berlin Heidelberg},
  isbn = {978-3-642-33711-6, 978-3-642-33712-3},
  url = {http://link.springer.com/chapter/10.1007/978-3-642-33712-3_62},
  abstract = {It is a challenging task to develop effective and efficient appearance models for robust object tracking due to factors such as pose variation, illumination change, occlusion, and motion blur. Existing online tracking algorithms often update models with samples from observations in recent frames. While much success has been demonstrated, numerous issues remain to be addressed. First, while these adaptive appearance models are data-dependent, there does not exist sufficient amount of data for online algorithms to learn at the outset. Second, online tracking algorithms often encounter the drift problems. As a result of self-taught learning, these mis-aligned samples are likely to be added and degrade the appearance models. In this paper, we propose a simple yet effective and efficient tracking algorithm with an appearance model based on features extracted from the multi-scale image feature space with data-independent basis. Our appearance model employs non-adaptive random projections that preserve the structure of the image feature space of objects. A very sparse measurement matrix is adopted to efficiently extract the features for the appearance model. We compress samples of foreground targets and the background using the same sparse measurement matrix. The tracking task is formulated as a binary classification via a naive Bayes classifier with online update in the compressed domain. The proposed compressive tracking algorithm runs in real-time and performs favorably against state-of-the-art algorithms on challenging sequences in terms of efficiency, accuracy and robustness.},
  number = {7574},
  urldate = {2013-11-15TZ},
  booktitle = {Computer {Vision} – {ECCV} 2012},
  publisher = {Springer Berlin Heidelberg},
  author = {Zhang, Kaihua and Zhang, Lei and Yang, Ming-Hsuan},
  editor = {Fitzgibbon, Andrew and Lazebnik, Svetlana and Perona, Pietro and Sato, Yoichi and Schmid, Cordelia},
  month = {January},
  year = {2012},
  note = {00321},
  keywords = {compressive sensing, learning, tracking},
  pages = {864--877}
}

{"_id":"Ae3g9TPK6rCPwNxXN","bibbaseid":"zhang-zhang-yang-realtimecompressivetracking-2012","downloads":0,"creationDate":"2015-09-03T07:18:48.472Z","title":"Real-Time Compressive Tracking","author_short":["Zhang, K.","Zhang, L.","Yang, M."],"year":2012,"bibtype":"incollection","biburl":"http://bibbase.org/zotero/fred.qi","bibdata":{"abstract":"It is a challenging task to develop effective and efficient appearance models for robust object tracking due to factors such as pose variation, illumination change, occlusion, and motion blur. Existing online tracking algorithms often update models with samples from observations in recent frames. While much success has been demonstrated, numerous issues remain to be addressed. First, while these adaptive appearance models are data-dependent, there does not exist sufficient amount of data for online algorithms to learn at the outset. Second, online tracking algorithms often encounter the drift problems. As a result of self-taught learning, these mis-aligned samples are likely to be added and degrade the appearance models. In this paper, we propose a simple yet effective and efficient tracking algorithm with an appearance model based on features extracted from the multi-scale image feature space with data-independent basis. Our appearance model employs non-adaptive random projections that preserve the structure of the image feature space of objects. A very sparse measurement matrix is adopted to efficiently extract the features for the appearance model. We compress samples of foreground targets and the background using the same sparse measurement matrix. The tracking task is formulated as a binary classification via a naive Bayes classifier with online update in the compressed domain. The proposed compressive tracking algorithm runs in real-time and performs favorably against state-of-the-art algorithms on challenging sequences in terms of efficiency, accuracy and robustness.","author":["Zhang, Kaihua","Zhang, Lei","Yang, Ming-Hsuan"],"author_short":["Zhang, K.","Zhang, L.","Yang, M."],"bibtex":"@incollection{ zhang_real-time_2012,\n series = {Lecture {Notes} in {Computer} {Science}},\n title = {Real-{Time} {Compressive} {Tracking}},\n copyright = {©2012 Springer-Verlag Berlin Heidelberg},\n isbn = {978-3-642-33711-6, 978-3-642-33712-3},\n url = {http://link.springer.com/chapter/10.1007/978-3-642-33712-3_62},\n abstract = {It is a challenging task to develop effective and efficient appearance models for robust object tracking due to factors such as pose variation, illumination change, occlusion, and motion blur. Existing online tracking algorithms often update models with samples from observations in recent frames. While much success has been demonstrated, numerous issues remain to be addressed. First, while these adaptive appearance models are data-dependent, there does not exist sufficient amount of data for online algorithms to learn at the outset. Second, online tracking algorithms often encounter the drift problems. As a result of self-taught learning, these mis-aligned samples are likely to be added and degrade the appearance models. In this paper, we propose a simple yet effective and efficient tracking algorithm with an appearance model based on features extracted from the multi-scale image feature space with data-independent basis. Our appearance model employs non-adaptive random projections that preserve the structure of the image feature space of objects. A very sparse measurement matrix is adopted to efficiently extract the features for the appearance model. We compress samples of foreground targets and the background using the same sparse measurement matrix. The tracking task is formulated as a binary classification via a naive Bayes classifier with online update in the compressed domain. The proposed compressive tracking algorithm runs in real-time and performs favorably against state-of-the-art algorithms on challenging sequences in terms of efficiency, accuracy and robustness.},\n number = {7574},\n urldate = {2013-11-15TZ},\n booktitle = {Computer {Vision} – {ECCV} 2012},\n publisher = {Springer Berlin Heidelberg},\n author = {Zhang, Kaihua and Zhang, Lei and Yang, Ming-Hsuan},\n editor = {Fitzgibbon, Andrew and Lazebnik, Svetlana and Perona, Pietro and Sato, Yoichi and Schmid, Cordelia},\n month = {January},\n year = {2012},\n note = {00321},\n keywords = {compressive sensing, learning, tracking},\n pages = {864--877}\n}","bibtype":"incollection","booktitle":"Computer Vision – ECCV 2012","copyright":"©2012 Springer-Verlag Berlin Heidelberg","editor":["Fitzgibbon, Andrew","Lazebnik, Svetlana","Perona, Pietro","Sato, Yoichi","Schmid, Cordelia"],"editor_short":["Fitzgibbon, A.","Lazebnik, S.","Perona, P.","Sato, Y.","Schmid, C."],"id":"zhang_real-time_2012","isbn":"978-3-642-33711-6, 978-3-642-33712-3","key":"zhang_real-time_2012","keywords":"compressive sensing, learning, tracking","month":"January","note":"00321","number":"7574","pages":"864--877","publisher":"Springer Berlin Heidelberg","series":"Lecture Notes in Computer Science","title":"Real-Time Compressive Tracking","type":"incollection","url":"http://link.springer.com/chapter/10.1007/978-3-642-33712-3_62","urldate":"2013-11-15TZ","year":"2012","bibbaseid":"zhang-zhang-yang-realtimecompressivetracking-2012","role":"author","urls":{"Paper":"http://link.springer.com/chapter/10.1007/978-3-642-33712-3_62"},"keyword":["compressive sensing","learning","tracking"],"downloads":0},"search_terms":["real","time","compressive","tracking","zhang","zhang","yang"],"keywords":["compressive sensing","learning","tracking"],"authorIDs":[],"dataSources":["y8en6y5RHukfeLuPH"]}