Publications associées à Poursuite de base

Sparsest piecewise-linear regression of one-dimensional data

Michaël Unser, Julien René Pierre Fageot, Thomas Jean Debarre, Quentin Alain Denoyelle

We study the problem of one-dimensional regression of data points with total-variation (TV) regularization (in the sense of measures) on the second derivative, which is known to promote piecewise-linear solutions with few knots. While there are efficient a ...

Elsevier2021

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

Emmanuel Emilien Louis Soubies, Quentin Alain Denoyelle, Gabriel Peyré

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

The Sliding Frank-Wolfe Algorithm for the BLASSO

Emmanuel Emilien Louis Soubies, Quentin Alain Denoyelle, Gabriel Peyré

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, Anant Raj

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

Smoothing technique for nonsmooth composite minimization with linear operator

Volkan Cevher, Van Quang Nguyen

We introduce and analyze an algorithm for the minimization of convex functions that are the sum of differentiable terms and proximable terms composed with linear operators. The method builds upon the recently developed smoothed gap technique. In addition t ...

2017

Learning Data Triage: Linear Decoding Works for Compressive MRI

Volkan Cevher, Yen-Huan Li

The standard approach to compressive sampling considers recovering an unknown deterministic signal with certain known structure, and designing the sub-sampling pattern and recovery algorithm based on the known structure. This approach requires looking for ...

Ieee2016

Convex Optimization Approaches for Blind Sensor Calibration using Sparsity

Rémi Gribonval, Gilles Puy

We investigate a compressive sensing framework in which the sensors introduce a distortion to the measurements in the form of unknown gains. We focus on blind calibration, using measures performed on multiple unknown (but sparse) signals and formulate the ...

Institute of Electrical and Electronics Engineers2014

Metric Learning with Rank and Sparsity Constraints

Volkan Cevher, Baran Gözcü, Bubacarr Bah

Choosing a distance preserving measure or metric is fun- damental to many signal processing algorithms, such as k- means, nearest neighbor searches, hashing, and compressive sensing. In virtually all these applications, the efficiency of the signal process ...

Ieee2014

Sparse Approximation Using M-Term Pursuit and Application in Image and Video Coding

Pascal Frossard, Pierre Vandergheynst, Adel Rahmoune

This paper introduces a novel algorithm for sparse approximation in redundant dictionaries called the M-term pursuit (MTP). This algorithm decomposes a signal into a linear combination of atoms that are selected in order to represent the main signal compon ...

Institute of Electrical and Electronics Engineers2012