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

IOP PUBLISHING LTD2020

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

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

LAYOUT ASSESSMENT METHOD AND SYSTEM

Frank Grégoire Jean de Morsier, Virginia Estellers Casas, Nathalie Casati, Maria Gabrani

Candidate layout patterns can be assessed using a sparse pattern dictionary of known design layout patterns by determining sparse coefficients for each candidate pattern, reconstructing the respective candidate pattern, and determining reconstruction error ...

U.S. Patent and Trademark Office; U.S. DEPARTMENT OF COMMERCE2013

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

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.

Poursuite de base

Sparsest piecewise-linear regression of one-dimensional data

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

The Sliding Frank-Wolfe Algorithm for the BLASSO

On Matching Pursuit and Coordinate Descent

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

Learning Data Triage: Linear Decoding Works for Compressive MRI

Convex Optimization Approaches for Blind Sensor Calibration using Sparsity

Metric Learning with Rank and Sparsity Constraints

LAYOUT ASSESSMENT METHOD AND SYSTEM

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

Graph Chatbot

Chattez avec Graph Search

On Matching Pursuit and Coordinate Descent

The Sliding Frank-Wolfe Algorithm for the BLASSO

Sparsest piecewise-linear regression of one-dimensional data

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

Learning Data Triage: Linear Decoding Works for Compressive MRI

LAYOUT ASSESSMENT METHOD AND SYSTEM

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

Convex Optimization Approaches for Blind Sensor Calibration using Sparsity

Metric Learning with Rank and Sparsity Constraints

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