Publications related to Matching Pursuit with Block Incoherent Dictionaries

Related publications (31)

Design of a Tap-Amplitude-Based Block Proportional Adaptive Filtering Algorithm

Proportional-type algorithms have attracted much attention because of their fast convergence ability for sparse system identification. To overcome the drawbacks of existing block proportional methods stemming from inadequate block partitioning, this articl ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2023

A Structured Dictionary Perspective on Implicit Neural Representations

Gizem Yüce, Pascal Frossard, Guillermo Ortiz Jimenez, Beril Besbinar

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 ...

IEEE COMPUTER SOC2022

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

Thomas Jean Debarre

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 ...

EPFL2022

Towards Verifiable, Generalizable and Efficient Robust Deep Neural Networks

Chen Liu

In the last decade, deep neural networks have achieved tremendous success in many fields of machine learning. However, they are shown vulnerable against adversarial attacks: well-designed, yet imperceptible, perturbations can make the state-of-the-art deep ...

EPFL2022

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

Hervé Bourlard, Selen Hande Kabil

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 ...

ISCA-INT SPEECH COMMUNICATION ASSOC2022

Sparse and Low-rank Modeling for Automatic Speech Recognition

Pranay Dighe

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 ...

EPFL2019

Learning of robust spectral graph dictionaries for distributed processing

Pascal Frossard, Ntorina Thanou

We consider the problem of distributed representation of signals in sensor networks, where sensors exchange quantized information with their neighbors. The signals of interest are assumed to have a sparse representation with spectral graph dictionaries. We ...

SPRINGEROPEN2018

On Matching Pursuit and Coordinate Descent

Martin Jaggi, Sebastian Urban Stich, Sai Praneeth Reddy Karimireddy

Two popular examples of first-order optimization methods over linear spaces are coordinate descent and matching pursuit algorithms, with their randomized variants. While the former targets the optimization by moving along coordinates, the latter considers ...

2018

Super Resolution Phase Retrieval for Sparse Signals

Martin Vetterli, Juri Ranieri, Gilles Baechler, Miranda Krekovic

In a variety of fields, in particular those involving imaging and optics, we often measure signals whose phase is missing or has been irremediably distorted. Phase retrieval attempts to recover the phase information of a signal from the magnitude of its Fo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

Convex optimization in sums of Banach spaces

Michaël Unser, Shayan Aziznejad

We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a finite sum of compo ...

2021

Phonetic Subspace Features for Improved Query by Example Spoken Term Detection

Hervé Bourlard, Afsaneh Asaei, Dhananjay Ram

This paper addresses the problem of detecting speech utterances from a large audio archive using a simple spoken query, hence referring to this problem as "Query by Example Spoken Term Detection" (QbE-STD). This still open pattern matching problem has been ...

2018

Unified Theory for Recovery of Sparse Signals in a General Transform Domain

Kyong Hwan Jin

Compressed sensing is provided a data-acquisition paradigm for sparse signals. Remarkably, it has been shown that the practical algorithms provide robust recovery from noisy linear measurements acquired at a near optimal sampling rate. In many real-world a ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2018

Multi-Arm Self-Collision Avoidance: A Sparse Solution for a Big Data Problem

Aude Billard, Seyed Sina Mirrazavi Salehian, Nadia Barbara Figueroa Fernandez

In this work, we propose a data-driven approach for real-time self-collision avoidance in multi-arm systems. The approach consists of modeling the regions in joint-space that lead to collisions via a Self-Collision Avoidance (SCA) boundary and use it as a ...

2018

Dictionary Learning for Two-Dimensional Kendall Shapes

Michaël Unser, Julien René Fageot, Virginie Sophie Uhlmann

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 ...

SIAM PUBLICATIONS2020

Multi-task additive models with shared transfer functions based on dictionary learning

Pascal Frossard, Alhussein Fawzi

Additive models form a widely popular class of regression models which represent the relation between covariates and response variables as the sum of low-dimensional transfer functions. Besides flexibility and accuracy, a key benefit of these models is the ...

Institute of Electrical and Electronics Engineers2017

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

Fabio Nobile, Francesca Bonizzoni

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 ...

2020

Graph learning under sparsity priors

Pascal Frossard, Ntorina Thanou, Hermina Petric Maretic

Graph signals offer a very generic and natural representation for data that lives on networks or irregular structures. The actual data structure is however often unknown a priori but can sometimes be estimated from the knowledge of the application domain. ...

Ieee2017

Dictionary Learning Based on Sparse Distribution Tomography

Michaël Unser, Pedram Pad

We propose a new statistical dictionary learning algorithm for sparse signals that is based on an α-stable innovation model. The parameters of the underlying model—that is, the atoms of the dictionary, the sparsity index α and the dispersion of the transfo ...

P. Pad2017

A deep learning framework for matching of SAR and optical imagery

Devis Tuia, Lloyd Haydn Hughes

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 ...

2020

Sparse inverse problems for Fourier imaging : applications to Optical Interferometry and Diffusion Magnetic Resonance Imaging

Anna Auria Rasclosa

Many natural images have low intrinsic dimension (a.k.a. sparse), meaning that they can be represented with very few coefficients when expressed in an adequate domain. The recent theory of Compressed Sensing exploits this property offering a powerful frame ...

EPFL2017