activity
20172026
most citedStructural Sparsity in Multiple Measurements

7 citations · 8 across the 7 of their papers we have counts for

collaborators
Showing math.NAShow all

6 papers · 1 filter

math.NA2026

Iterated graph Laplacian for image restoration problems

Stefano Aleotti, Davide Bianchi, Florian Bossmann +2

We study the graph Laplacian operator as a regularizer in a generalized Tikhonov framework for linear ill-posed problems. The Laplacian is updated iteratively from the current reco…

math.NA2024

Improved impedance inversion by the iterated graph Laplacian

Davide Bianchi, Florian Bossmann, Wenlong Wang +1

We introduce a data-adaptive inversion method that integrates classical or deep learning-based approaches with iterative graph Laplacian regularization, specifically targeting acou…

math.NA2021★ 7 cited

Structural Sparsity in Multiple Measurements

Florian Boßmann, Sara Krause-Solberg, Johannes Maly +1

We propose a novel sparsity model for distributed compressed sensing in the multiple measurement vectors (MMV) setting. Our model extends the concept of row-sparsity to allow more…

math.NA2019★ 1 cited

A direct solver for the phase retrieval problem in ptychographic imaging

Nada Sissouno, Florian Boßmann, Frank Filbir +5

Measurements achieved with ptychographic imaging are a special case of diffraction measurements. They are generated by illuminating small parts of a sample with, e.g., a focused X-…

math.NA2017

Modeling variational inpainting methods with splines

Florian Boßmann, Tomas Sauer, Nada Sissouno

Mathematical methods of image inpainting involve the discretization of given continuous models. We present a method that avoids the standard pointwise discretization by modeling kn…

math.NA2017

Generalized orthogonal matching pursuit for multiple measurements - A structural approach

Florian Boßmann

Sparse data approximation has become a popular research topic in signal processing. However, in most cases only a single measurement vector (SMV) is considered. In applications, th…