Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Matching pursuit

Publications associées (30)

Learned Compressive Representations for Single-Photon 3D Imaging

Edoardo Charbon, Claudio Bruschini, Andrei Ardelean

Single-photon 3D cameras can record the time-of-arrival of billions of photons per second with picosecond accuracy. One common approach to summarize the photon data stream is to build a per-pixel timestamp histogram, resulting in a 3D histogram tensor that ...

Ieee Computer Soc2023

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

Michaël Unser, Rahul Parhi

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

IEEE Institute of Electrical and Electronics Engineers2023

A Structured Dictionary Perspective on Implicit Neural Representations

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

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

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

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

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

The sliding Frank-Wolfe algorithm and its application to super-resolution microscopy

Emmanuel Emilien Louis Soubies, Quentin Alain Denoyelle

This paper showcases the theoretical and numerical performance of the Sliding Frank-Wolfe, which is a novel optimization algorithm to solve the BLASSO sparse spikes super-resolution problem. The BLASSO is a continuous (i.e. off-the-grid or grid-less) count ...

2020

A new analysis approach for T-2 relaxometry myelin water quantification: Orthogonal Matching Pursuit

Guillaume Jean Op 't Veld

Purpose: In vivo myelin quantification can provide valuable noninvasive information on neuronal maturation and development, as well as insights into neurological disorders. Multiexponential analysis of multiecho T-2 relaxation is a powerful and widely appl ...

Wiley2019

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

Hervé Bourlard, Afsaneh Asaei, Pranay Dighe

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

ELSEVIER SCIENCE BV2019

Sparse Dictionaries for Continuous-Domain Inverse Problems

Michaël Unser, Shayan Aziznejad, Thomas Jean Debarre

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

2019

Joint Sparsity with Partially Known Support and Application to Ultrasound Imaging

Jean-Philippe Thiran, Yves Wiaux, Adrien Georges Jean Besson, Dimitris Perdios

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

IEEE Institute of Electrical and Electronics Engineers2019

Deep Micro-Dictionary Learning and Coding Network

Yan Yan, Wei Wang

In this paper, we propose a novel Deep Micro-Dictionary Learning and Coding Network (DDLCN). DDLCN has most of the standard deep learning layers (pooling, fully, connected, input/output, etc.) but the main difference is that the fundamental convolutional l ...

IEEE2019

Weighted Matchings via Unweighted Augmentations

Ola Nils Anders Svensson, Slobodan Mitrovic, Buddhima Ruwanmini Gamlath Gamlath Ralalage, Sagar Sudhir Kale

We design a generic method to reduce the task of finding weighted matchings to that of finding short augmenting paths in unweighted graphs. This method enables us to provide efficient implementations for approximating weighted matchings in the massively pa ...

ASSOC COMPUTING MACHINERY2019

The Sliding Frank-Wolfe Algorithm for the BLASSO

Emmanuel Emilien Louis Soubies, Quentin Alain Denoyelle

This paper showcases the Sliding Frank-Wolfe (SFW), which is a novel optimization algorithm to solve the BLASSO sparse spikes super-resolution problem. The BLASSO is the continuous (i.e. off-thegrid or grid-less) counterpart of the well-known `1 sparse reg ...

2019

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

Low Frequency Sound Field Reconstruction in Non-rectangular Room: A Numerical Validation

Hervé Lissek, Etienne Thierry Jean-Luc Rivet, Vu Thach Pham

Characterization of sound fields in rooms has always been a challenging task. A faithful reconstruction of sound fields in rooms generally would require an impractically high number of microphones. At low frequencies, where sound field can be modeled as a ...

2018

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

A Sub-μW/Channel, 16-Channel Seizure Detection and Signal Acquisition SoC Based on Multichannel Compressive Sensing

Alexandre Schmid, Reza Ranjandish

An accurate 16-channel seizure detection system-on-chip is presented, which is based on extracting features from the compressed recorded data using multichannel compressive sensing (MCS). MCS is used to reduce the transmission data rate of sparse biologica ...

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

A Compressed Sensing Approach for Distribution Matching

Vahid Aref, Mohamad Baker Dia

In this work, we formulate the fixed-length distribution matching as a Bayesian inference problem. Our proposed solution is inspired from the compressed sensing paradigm and the sparse superposition (SS) codes. First, we introduce sparsity in the binary so ...

IEEE2018