Accelerating Particle Filter Using Randomized Multiscale and Fast Multipole Type Methods

Particle filter is a powerful tool for state tracking using non-linear observations. We present a multiscale based method that accelerates the tracking computation by particle filters. Unlike the conventional way, which calculates weights over all particles in each cycle of the algorithm, we sample...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on pattern analysis and machine intelligence. - 1979. - 37(2015), 7 vom: 14. Juli, Seite 1396-407
1. Verfasser: Shabat, Gil (VerfasserIn)
Weitere Verfasser: Shmueli, Yaniv, Bermanis, Amit, Averbuch, Amir
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2015
Zugriff auf das übergeordnete Werk:IEEE transactions on pattern analysis and machine intelligence
Schlagworte:Journal Article Research Support, Non-U.S. Gov't Research Support, U.S. Gov't, Non-P.H.S.
LEADER 01000naa a22002652 4500
001 NLM252583469
003 DE-627
005 20231224164423.0
007 cr uuu---uuuuu
008 231224s2015 xx |||||o 00| ||eng c
024 7 |a 10.1109/TPAMI.2015.2392754  |2 doi 
028 5 2 |a pubmed24n0842.xml 
035 |a (DE-627)NLM252583469 
035 |a (NLM)26352448 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Shabat, Gil  |e verfasserin  |4 aut 
245 1 0 |a Accelerating Particle Filter Using Randomized Multiscale and Fast Multipole Type Methods 
264 1 |c 2015 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 24.11.2015 
500 |a Date Revised 10.09.2015 
500 |a published: Print 
500 |a Citation Status PubMed-not-MEDLINE 
520 |a Particle filter is a powerful tool for state tracking using non-linear observations. We present a multiscale based method that accelerates the tracking computation by particle filters. Unlike the conventional way, which calculates weights over all particles in each cycle of the algorithm, we sample a small subset from the source particles using matrix decomposition methods. Then, we apply a function extension algorithm that uses a particle subset to recover the density function for all the rest of the particles not included in the chosen subset. The computational effort is substantial especially when multiple objects are tracked concurrently. The proposed algorithm significantly reduces the computational load. By using the Fast Gaussian Transform, the complexity of the particle selection step is reduced to a linear time in n and k, where n is the number of particles and k is the number of particles in the selected subset. We demonstrate our method on both simulated and on real data such as object tracking in video sequences 
650 4 |a Journal Article 
650 4 |a Research Support, Non-U.S. Gov't 
650 4 |a Research Support, U.S. Gov't, Non-P.H.S. 
700 1 |a Shmueli, Yaniv  |e verfasserin  |4 aut 
700 1 |a Bermanis, Amit  |e verfasserin  |4 aut 
700 1 |a Averbuch, Amir  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on pattern analysis and machine intelligence  |d 1979  |g 37(2015), 7 vom: 14. Juli, Seite 1396-407  |w (DE-627)NLM098212257  |x 1939-3539  |7 nnns 
773 1 8 |g volume:37  |g year:2015  |g number:7  |g day:14  |g month:07  |g pages:1396-407 
856 4 0 |u http://dx.doi.org/10.1109/TPAMI.2015.2392754  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 37  |j 2015  |e 7  |b 14  |c 07  |h 1396-407