3 accepted papers
We extend the notion of sparse representation to the case where the atoms are not vectors, but cones, hence infinite sets. The sparse representation is linear, as usual, but the most convenient vector is chosen from each selected cone. We give a cone version of Orthogonal Matching Pursuit (OMP) and…
Pairwise, or separable, dictionaries are suited for the sparse representation of 2D signals in their original form, without vectorization. They are equivalent with enforcing a Kronecker structure on a standard dictionary for 1D signals. We present a dictionary learning algorithm, in the coordinate d…
We propose a low complexity method for estimating direction of arrival (DOA) when the positions of the array sensors are affected by errors with known magnitude bound. This robust DOA method is based on solving an optimization problem whose solution is obtained in two stages. First, the problem is r…