Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This article presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their performance in finding sparse signal representations in redundant dictionaries. These algorithms can be split into a sensing and a reconstruction step, and the former will fail to identify correct atoms if the cumulative coherence of the dictionary is too high. We thus modify the sensing step by introducing a special sensing matrix, also referred to as a measurement ensemble. The correct selection of components is then determined by the
Edoardo Charbon, Claudio Bruschini, Andrei Ardelean, Mohit Gupta
Patrick Thiran, Matthias Grossglauser, Victor Kristof