Publication

Guaranteed recovery of a low-rank and joint-sparse matrix from incomplete and noisy measurements

Publications associées (39)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Greedy Dictionary Selection for Sparse Representation

Volkan Cevher, Andreas Krause

We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse, we mean that only a few dictionary elements, compared to the ambient signal ...

2011

Ultrasound Tomography with Learned Dictionaries

Martin Vetterli, Pascal Frossard, Ivana Tosic, Ivana Jovanovic

We propose a new method for imaging sound speed in breast tissue from measurements obtained by ultrasound tomography (UST) scan- ners. Given the measurements, our algorithm finds a sparse image representation in an overcomplete dictionary that is adapted t ...

2010

Compressive Sensing of Localized Signals: Application to Analog-to-Information Conversion

Juri Ranieri

Compressed sensing hinges on the sparsity of signals to allow their reconstruction starting from a limited number of measures. When reconstruction is possible, the SNR of the reconstructed signal depends on the energy collected in the acquisition. Hence, i ...

2010

Sparsity & [and] dictionaries - algorithms & [and] design

Karin Schnass

With the flood of information available today the question how to deal with high dimensional data/signals, which are cumbersome to handle, to calculate with and to store, is highly important. One approach to reducing this flood is to find sparse signal rep ...

EPFL2009

Dequantizing Compressed Sensing: When Oversampling and Non-Gaussian Constraints Combine

Laurent Jacques

The theory of Compressed Sensing (CS) is based on reconstructing sparse signals from random linear measurements. As measurement of continuous signals by digital devices always involves some form of quantization, in practice devices based on CS encoding mus ...

2009

Dequantizing Compressed Sensing with non-Gaussian Constraints

Laurent Jacques

2009

Recovery of clustered sparse signals from compressive measurements

Volkan Cevher

We introduce a new signal model, called (K,C)-sparse, to capture K-sparse signals in N dimensions whose nonzero coefficients are contained within at most C clusters, with C < K < N. In contrast to the existing work in the sparse approximation and compress ...

2009

Support Recovery in Compressed Sensing: An Estimation Theoretic Approach

Martin Vetterli, Amin Karbasi, Ali Hormati

Compressed sensing (CS) deals with the reconstruction of sparse signals from a small number of linear measurements. One of the main challenges in CS is to find the support of a sparse signal from a set of noisy observations. In the CS literature, several i ...

2009

Support Recovery in Compressed Sensing: An Estimation Theoretic Approach

Martin Vetterli, Amin Karbasi, Ali Hormati

2009

Greedy dictionary selection for sparse representation

Volkan Cevher

2009