ITCVOCMay 10, 2016

Measurement Bounds for Sparse Signal Reconstruction with Multiple Side Information

arXiv:1605.03234v24 citations
Originality Incremental advance
AI Analysis

It addresses signal reconstruction with side information for applications like object recognition, offering incremental improvements over existing compressed sensing techniques.

This paper tackles the problem of reconstructing sparse signals in compressed sensing using multiple correlated side information sources, proposing a weighted n-ℓ1 minimization framework and RAMSI algorithm that adaptively optimizes weights, achieving sharper theoretical bounds and outperforming state-of-the-art methods in experiments.

In the context of compressed sensing (CS), this paper considers the problem of reconstructing sparse signals with the aid of other given correlated sources as multiple side information. To address this problem, we theoretically study a generic \textcolor{black}{weighted $n$-$\ell_{1}$ minimization} framework and propose a reconstruction algorithm that leverages multiple side information signals (RAMSI). The proposed RAMSI algorithm computes adaptively optimal weights among the side information signals at every reconstruction iteration. In addition, we establish theoretical bounds on the number of measurements that are required to successfully reconstruct the sparse source by using \textcolor{black}{weighted $n$-$\ell_{1}$ minimization}. The analysis of the established bounds reveal that \textcolor{black}{weighted $n$-$\ell_{1}$ minimization} can achieve sharper bounds and significant performance improvements compared to classical CS. We evaluate experimentally the proposed RAMSI algorithm and the established bounds using synthetic sparse signals as well as correlated feature histograms, extracted from a multiview image database for object recognition. The obtained results show clearly that the proposed algorithm outperforms state-of-the-art algorithms---\textcolor{black}{including classical CS, $\ell_1\text{-}\ell_1$ minimization, Modified-CS, regularized Modified-CS, and weighted $\ell_1$ minimization}---in terms of both the theoretical bounds and the practical performance.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes