Performance evaluation of Atomic Decomposition algorithms

This papers presents an exhaustive evaluation of the different implementations proposed for Atomic Decomposition. Probabilistic and deterministic search algorithms are analysed and their performance tested in terms of detection, estimation, computational burden and resolution. We also introduce a new, efficient implementation that outperforms the former ones in terms of detection and estimation.