Building robust appearance models using on-line feature selection

被引:0
|
作者
Porter, R. [1 ]
Loveland, R. [1 ]
Rosten, E. [1 ]
机构
[1] Los Alamos Natl Lab, Int Space & Response Technol Div, Los Alamos, NM 87545 USA
来源
关键词
tracking; recognition; adaptive appearance models; feature selection;
D O I
10.1117/12.721439
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In many tracking applications, adapting the target appearance model over time can improve performance. This approach is most popular in high frame rate video applications where latent variables, related to the objects appearance (e.g., orientation and pose), vary slowly from one frame to the next. In these cases the appearance model and the tracking system are tightly integrated, and latent variables are often included as part of the tracking system's dynamic model. In this paper we describe our efforts to track cars in low frame rate data (I frame / second), acquired from a highly unstable airborne platform. Due to the low frame rate, and poor image quality, the appearance of a particular vehicle varies greatly from one frame to the next. This leads us to a different problem: how can we build the best appearance model from all instances of a vehicle we have seen so far. The best appearance model should maximize the future performance of the tracking system, and maximize the chances of reacquiring the vehicle once it leaves the field of view. We propose an online feature selection approach to this problem and investigate the performance and computational trade-offs with a real-world dataset.
引用
收藏
页数:9
相关论文
共 50 条
  • [41] ON-LINE PROCESS MONITORING USING A ROBUST STATISTICS BASED METHODOLOGY
    Llanos, C. E.
    Chavez Galletti, R. J.
    Sanchez, M. C.
    Maronna, R.
    LATIN AMERICAN APPLIED RESEARCH, 2019, 49 (02) : 111 - 116
  • [42] A Robust Feature Selection Algorithm
    Chandra, B.
    2016 9TH INTERNATIONAL CONFERENCE ON DEVELOPMENTS IN ESYSTEMS ENGINEERING (DESE 2016), 2016, : 308 - 313
  • [43] On-Line Building Energy Optimization Using Deep Reinforcement Learning
    Mocanu, Elena
    Mocanu, Decebal Constantin
    Nguyen, Phuong H.
    Liotta, Antonio
    Webber, Michael E.
    Gibescu, Madeleine
    Slootweg, J. G.
    IEEE TRANSACTIONS ON SMART GRID, 2019, 10 (04) : 3698 - 3708
  • [44] On-line thermal stress monitoring using mathematical models
    Lausterer, GK
    CONTROL OF POWER PLANTS AND POWER SYSTEMS (SIPOWER'95), 1996, : 225 - 230
  • [45] On-line thermal stress monitoring using mathematical models
    Lausterer, GK
    CONTROL ENGINEERING PRACTICE, 1997, 5 (01) : 85 - 90
  • [46] Optimal Feature Selection and Inter-Operability Compensation for On-Line Biometric Signature Authentication
    Tolosana, Ruben
    Vera-Rodriguez, Ruben
    Ortega-Garcia, Javier
    Fierrez, Julian
    2015 INTERNATIONAL CONFERENCE ON BIOMETRICS (ICB), 2015, : 163 - 168
  • [47] Monocular person tracking and identification with on-line deep feature selection for person following robots
    Koide, Kenji
    Miura, Jun
    Menegatti, Emanuele
    ROBOTICS AND AUTONOMOUS SYSTEMS, 2020, 124
  • [48] On-line order selection for communications
    Ni, HM
    Adali, T
    2001 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, VOLS I-VI, PROCEEDINGS: VOL I: SPEECH PROCESSING 1; VOL II: SPEECH PROCESSING 2 IND TECHNOL TRACK DESIGN & IMPLEMENTATION OF SIGNAL PROCESSING SYSTEMS NEURALNETWORKS FOR SIGNAL PROCESSING; VOL III: IMAGE & MULTIDIMENSIONAL SIGNAL PROCESSING MULTIMEDIA SIGNAL PROCESSING - VOL IV: SIGNAL PROCESSING FOR COMMUNICATIONS; VOL V: SIGNAL PROCESSING EDUCATION SENSOR ARRAY & MULTICHANNEL SIGNAL PROCESSING AUDIO & ELECTROACOUSTICS; VOL VI: SIGNAL PROCESSING THEORY & METHODS STUDENT FORUM, 2001, : 1313 - 1316
  • [49] The contribution of feature selection and morphological operation for on-line business system’s image classification
    University Sultan Zainal Abidin, Tembila Campus, Terengganu, Malaysia
    Int. J. Multimedia Ubiquitous Eng., 11 (303-314):
  • [50] On-line selection of an acceptable pair
    Preater, J.
    JOURNAL OF APPLIED PROBABILITY, 2006, 43 (03) : 729 - 740