A low complexity orthogonal matching pursuit for sparse signal approximation with shift-invariant dictionaries

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

In inverse problems, the task is to reconstruct an unknown signal from its possibly noise-corrupted measurements. Penalized-likelihood-based estimation and Bayesian estimation are two powerful statistical paradigms for the resolution of such problems. They ...

The usual explanation of the efficacy of wavelet-based methods hinges on the sparsity of many real-world objects in the wavelet domain. Yet, standard wavelet-shrinkage techniques for sparse reconstruction are not competitive in practice, one reason being t ...

The goal of this thesis is to study continuous-domain inverse problems for the reconstruction of sparse signals and to develop efficient algorithms to solve such problems computationally. The task is to recover a signal of interest as a continuous function ...

Implicit neural representations (INRs) have recently emerged as a promising alternative to classical discretized representations of signals. Nevertheless, despite their practical success, we still do not understand how INRs represent signals. We propose a ...

Starting from a strong Lattice-Free Maximum Mutual Information (LF-MMI) baseline system, we explore different autoencoder configurations to enhance Mel-Frequency Cepstral Coefficients (MFCC) features. Autoencoders are expected to generate new MFCC features ...

Fast and accurate transmission line outage detection can help the central control unit to respond rapidly to better maintain the security and reliability of power systems. It is especially critical in the situation of multiple line outages which is more li ...

Functional time series is a temporally ordered sequence of not necessarily independent random curves. While the statistical analysis of such data has been traditionally carried out under the assumption of completely observed functional data, it may well ha ...

Nowadays, image and video are the data types that consume most of the resources of modern communication channels, both in fixed and wireless networks. Thus, it is vital to compress visual data as much as possible, while maintaining some target quality leve ...

We propose a novel sparse dictionary learning method for planar shapes in the sense of Kendall, namely configurations of landmarks in the plane considered up to similitudes. Our shape dictionary method provides a good trade-off between algorithmic simplici ...

SAR and optical imagery provide highly complementary information about observed scenes. A combined use of these two modalities is thus desirable in many data fusion scenarios. However, any data fusion task requires measurements to be accurately aligned. Wh ...

This thesis focuses on developing efficient algorithmic tools for processing large datasets. In many modern data analysis tasks, the sheer volume of available datasets far outstrips our abilities to process them. This scenario commonly arises in tasks incl ...

We study the Darcy boundary value problem with lognormal permeability field. We adopt a perturbation approach, expanding the solution in Taylor series around the nominal value of the coefficient, and approximating the expected value of the stochastic solut ...

Deep neural networks often have millions of parameters. This can hinder their deployment to low-end devices, not only due to high memory requirements but also because of increased latency at inference. We propose a novel model compression method that gener ...

Objective. Among the different approaches for denoising neural signals, wavelet-based methods are widely used due to their ability to reduce in-band noise. All wavelet denoising algorithms have a common structure, but their effectiveness strongly depends o ...

We investigate the benefits of known partial support for the recovery of joint-sparse signals and demonstrate that it is advantageous in terms of recovery performance for both rank-blind and rank-aware algorithms. We suggest extensions of several joint-spa ...

Towards the goal of improving acoustic modeling for automatic speech recognition (ASR), this work investigates the modeling of senone subspaces in deep neural network (DNN) posteriors using low-rank and sparse modeling approaches. While DNN posteriors are ...

We study 1D continuous-domain inverse problems for multicomponent signals. The prior assumption on these signals is that each component is sparse in a different dictionary specified by a regularization operators. We introduce a hybrid regularization functi ...

Reconstructing continuous signals based on a small number of discrete samples is a fundamental problem across science and engineering. We are often interested in signals with "simple" Fourier structure - e.g., those involving frequencies within a bounded r ...

This thesis deals with exploiting the low-dimensional multi-subspace structure of speech towards the goal of improving acoustic modeling for automatic speech recognition (ASR). Leveraging the parsimonious hierarchical nature of speech, we hypothesize that ...

We propose a discretization method for continuous-domain linear inverse problems with multiple-order total-variation (TV) regularization. It is based on a recent result that proves that such inverse problems have sparse polynomial-spline solutions. Our met ...

A low complexity orthogonal matching pursuit for sparse signal approximation with shift-invariant dictionaries

Chat with Graph Search

Statistical Inference for Inverse Problems: From Sparsity-Based Methods to Neural Networks

The Sparsity of Cycle Spinning for Wavelet-Based Solutions of Linear Inverse Problems

Variational Methods For Continuous-Domain Inverse Problems: the Quest for the Sparsest Solution

A Structured Dictionary Perspective on Implicit Neural Representations

From Undercomplete to Sparse Overcomplete Autoencoders to Improve LF-MMI Speech Recognition

Multiple Line Outage Detection in Power Systems by Sparse Recovery Using Transient Data

Sparsely Observed Functional Time Series: Theory and Applications

Learning-based Image Coding: Early Solutions Reviewing and Subjective Quality Evaluation

Dictionary Learning for Two-Dimensional Kendall Shapes

A deep learning framework for matching of SAR and optical imagery

Fourier Sampling in Signal Processing and Numerical Linear Algebra

Regularity and sparse approximation of the recursive first moment equations for the lognormal Darcy problem

Dynamic Model Pruning with Feedback

Systematic analysis of wavelet denoising methods for neural signal processing

Joint Sparsity with Partially Known Support and Application to Ultrasound Imaging

Low-rank and sparse subspace modeling of speech for DNN based acoustic modeling

Sparse Dictionaries for Continuous-Domain Inverse Problems

A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transforms

Sparse and Low-rank Modeling for Automatic Speech Recognition

Solving Continuous-Domain Problems Exactly with Multiresolution B-Splines