Compressed sensing with unknown sensor permutation - Archive ouverte HAL Access content directly
Conference Papers Year : 2014

Compressed sensing with unknown sensor permutation

(1) , (1) , (2) , (3)
1
2
3

Abstract

Compressed sensing is the ability to retrieve a sparse vector from a set of linear measurements. The task gets more difficult when the sensing process is not perfectly known. We address such a problem in the case where the sensors have been permuted, i.e., the order of the measurements is unknown. We propose a branch-and-bound algorithm that converges to the solution. The experimental study shows that our approach always retrieves the unknown permutation, while a simple convex relaxation strategy almost always fails. In terms of its time complexity, we show that the proposed algorithm converges quickly with respect to the combinatorial nature of the problem.
Fichier principal
Vignette du fichier
PermutationIcassp.pdf (198.97 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00881407 , version 1 (08-11-2013)
hal-00881407 , version 2 (22-04-2014)

Identifiers

Cite

Valentin Emiya, Antoine Bonnefoy, Laurent Daudet, Rémi Gribonval. Compressed sensing with unknown sensor permutation. ICASSP - IEEE International Conference on Acoustics Speech and Signal Processing, May 2014, Florence, Italy. ⟨10.1109/ICASSP.2014.6853755⟩. ⟨hal-00881407v2⟩
934 View
1140 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More