![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Open AccessPaired single-cell multi-omics data integration with Mowgli
The profiling of multiple molecular layers from the same set of cells has recently become possible. There is thus a growing need for multi-view learning methods able to jointly analyze these data. We here pres...
-
Article
Smooth over-parameterized solvers for non-smooth structured optimization
Non-smooth optimization is a core ingredient of many imaging or machine learning pipelines. Non-smoothness encodes structural constraints on the solutions, such as sparsity, group sparsity, low-rank and sharp ...
-
Article
The Geometry of Off-the-Grid Compressed Sensing
Compressed sensing (CS) ensures the recovery of sparse vectors from a number of randomized measurements proportional to their sparsity. The initial theory considers discretized domains, and the randomness make...
-
Article
Ground Metric Learning on Graphs
Optimal transport (OT) distances between probability distributions are parameterized by the ground metric they use between observations. Their relevance for real-life applications strongly hinges on whether th...
-
Article
Preface to the Special Issue on Optimization for Data Sciences
-
Article
Guest Editorial JMIV Special Issue Mathematics and Image Analysis (MIA)
-
Article
An Interpolating Distance Between Optimal Transport and Fisher–Rao Metrics
This paper defines a new transport metric over the space of nonnegative measures. This metric interpolates between the quadratic Wasserstein and the Fisher–Rao metrics and generalizes optimal transport to meas...
-
Article
JMIV Special Issue Mathematics and Image Analysis
-
Article
Support Recovery for Sparse Super-Resolution of Positive Measures
We study sparse spikes super-resolution over the space of Radon measures on \(\mathbb {R}\) ...
-
Article
The degrees of freedom of partly smooth regularizers
We study regularized regression problems where the regularizer is a proper, lower-semicontinuous, convex and partly smooth function relative to a Riemannian submanifold. This encompasses several popular exampl...
-
Article
Local Convergence Properties of Douglas–Rachford and Alternating Direction Method of Multipliers
The Douglas–Rachford and alternating direction method of multipliers are two proximal splitting algorithms designed to minimize the sum of two proper lower semi-continuous convex functions whose proximity oper...
-
Chapter and Conference Paper
Optimal Transport for Diffeomorphic Registration
This paper introduces the use of unbalanced optimal transport methods as a similarity measure for diffeomorphic matching of imaging data. The similarity measure is a key object in diffeomorphic registration me...
-
Article
Convergence rates with inexact non-expansive operators
In this paper, we present a convergence rate analysis for the inexact Krasnosel’skiĭ–Mann iteration built from non-expansive operators. The presented results include two main parts: we first establish the glob...
-
Article
Exact Support Recovery for Sparse Spikes Deconvolution
This paper studies sparse spikes deconvolution over the space of measures. We focus on the recovery properties of the support of the measure (i.e., the location of the Dirac masses) using total variation of me...
-
Article
Guest Editorial: Mathematics and Image Analysis
-
Article
Variational Texture Synthesis with Sparsity and Spectrum Constraints
This paper introduces a new approach for texture synthesis. We propose a unified framework that both imposes first order statistical constraints on the use of atoms from an adaptive dictionary, as well as seco...
-
Chapter and Conference Paper
Activity Identification and Local Linear Convergence of Douglas–Rachford/ADMM under Partial Smoothness
Convex optimization has become ubiquitous in most quantitative disciplines of science, including variational image processing. Proximal splitting algorithms are becoming popular to solve such structured convex...
-
Chapter
Low Complexity Regularization of Linear Inverse Problems
Inverse problems and regularization theory is a central theme in imaging sciences, statistics, and machine learning. The goal is to reconstruct an unknown vector from partial indirect, and possibly noisy, meas...
-
Article
Sliced and Radon Wasserstein Barycenters of Measures
This article details two approaches to compute barycenters of measures using 1-D Wasserstein distances along radial projections of the input measures. The first method makes use of the Radon transform of the m...
-
Article
Guest Editorial