Accelerated A-contrario Detection of Smooth Trajectories

Abstract : The detection of smooth trajectories in a (noisy) point set sequence can be realized optimally with the ASTRE algorithm, but the quadratic time and memory complexity of this algorithm with respect to the number of frames is prohibitive for many practical applications. We here propose a variant that cuts the input sequence into overlapping temporal chunks that are processed in a sequential (but non-independent) way, which results in a linear complexity with respect to the number of frames. Surprisingly, the performances are in general not affected by this acceleration strategy, and are sometimes even slightly above those of the original ASTRE algorithm.
Liste complète des métadonnées

Cited literature [8 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00957747
Contributor : Lionel Moisan <>
Submitted on : Thursday, February 18, 2016 - 10:31:20 AM
Last modification on : Thursday, April 11, 2019 - 4:02:09 PM
Document(s) archivé(s) le : Thursday, May 19, 2016 - 10:26:41 AM

File

2014-09r.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00957747, version 2

Collections

Citation

Rémy Abergel, Lionel Moisan. Accelerated A-contrario Detection of Smooth Trajectories. EUSIPCO 2014, 22nd European Signal Processing Conference , Sep 2014, Lisbonne, Portugal. Proceedings of the 22nd European Signal Processing Conference (Eusipco), 2014, 〈http://www.eurasip.org/Proceedings/Eusipco/Eusipco2014/EUSIPCO2014.html〉. 〈hal-00957747v2〉

Share

Metrics

Record views

72

Files downloads

43