Publication

Compressive Sampling Strategies for Multichannel Signals

Publications associées (94)

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

Sparse Signal Acquisition and Recovery with Graphical Models

Volkan Cevher

A great deal of theoretic and algorithmic research has revolved around sparsity view of signals over the last decade to characterize new, sub-Nyquist sampling limits as well as tractable algorithms for signal recovery from dimensionality reduced measuremen ...

Institute of Electrical and Electronics Engineers2010

Model-based compressive sensing

Volkan Cevher

Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals that can be well approximated by just K < N elements from an N-dimensional basis. Instead of taking periodic samples, we measure inner ...

Institute of Electrical and Electronics Engineers2010

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

A Sparsity Constraint for Topic Models - Application to Temporal Activity Mining

Jean-Marc Odobez, Rémi Emonet, Jagannadan Varadarajan

We address the mining of sequential activity patterns from document logs given as word-time occurrences. We achieve this using topics that models both the cooccurrence and the temporal order in which words occur within a temporal window. Discovering such t ...

2010

A Sparsity Constraint for Topic Models - Application to Temporal Activity Mining

Jean-Marc Odobez, Rémi Emonet, Jagannadan Varadarajan

Idiap2010

Compressive sensing recovery of spike trains using a structured sparsity model

Volkan Cevher

The theory of Compressive Sensing (CS) exploits a well-known concept used in signal compression – sparsity – to design new, efficient techniques for signal acquisition. CS theory states that for a length-N signal x with sparsity level K, M = O(K log(N/K)) ...

2009

Recovery of Compressible Signals in Unions of Subspaces

Volkan Cevher

Compressive sensing (CS) is an alternative to Shannon/Nyquist sampling for acquisition of sparse or compressible signals; instead of taking periodic samples, we measure inner products with All < N random vectors and then recover the signal via a sparsity-s ...

2009

On unifying sparsity and geometry for image-based 3D scene representation

Ivana Tosic

Demand has emerged for next generation visual technologies that go beyond conventional 2D imaging. Such technologies should capture and communicate all perceptually relevant three-dimensional information about an environment to a distant observer, providin ...

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