Demo Data from EDBT 2026 / reviewers in the wild / expert
Mathias Hockmann
dblp:300/4634
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2025
0000-0003-3805-5077ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
1 paper |
Information theory · 100% | |
| Computer graphics and multimedia
1 paper |
Image and video processing · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › estimation theory › estimation bounds
cramér-rao bound |
0.9 | 1 | 2025 | Analysis of the Sparse Super Resolution Limit Using the Cramér-Rao Lower Bound · IEEE Trans. Inf. Theory 2025 |
Information theory
estimation theory |
0.9 | 1 | 2025 | Analysis of the Sparse Super Resolution Limit Using the Cramér-Rao Lower Bound · IEEE Trans. Inf. Theory 2025 |
Image and video processing
super-resolution |
0.3 | 1 | 2025 | Analysis of the Sparse Super Resolution Limit Using the Cramér-Rao Lower Bound · IEEE Trans. Inf. Theory 2025 |
Methods — techniques the papers use, named apart from their topics
statistical analysis · 1.7cramér-rao lower bound · 1.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Analysis of the Sparse Super Resolution Limit Using the Cramér-Rao Lower BoundabstractAlready since the work by Abbe and Rayleigh the difficulty of super resolution where one wants to recover a collection of point sources from low-resolved microscopy measurements is thought to be dependent on whether the distance between the sources is below or above a certain resolution or diffraction limit. Even though there has been a number of approaches to define this limit more rigorously, there is still a gap between the situation where the task is known to be hard and scenarios where the task is provably simpler. For instance, an interesting approach for the univariate case using the size of the Cramér-Rao lower bound was introduced in a recent work by Ferreira Da Costa and Mitra. In this paper, we prove their conjecture on the transition point between good and worse tractability of super resolution and extend it to higher dimensions. Specifically, the bivariate statistical analysis allows to link the findings by the Cramér-Rao lower bound to the classical Rayleigh limit. Mathias Hockmann |
IEEE Trans. Inf. Theory | 1 |
| 2023 | Short Communication: Weak Sparse Superresolution is Well-ConditionedabstractAbstract. This paper considers superresolution (SR) as the mapping of Fourier coefficients of a discrete measure on [Formula: see text] to its support and weights. We focus on weak SR assuming a condition on the separation of the involved measures similar to the Rayleigh criterion and prove that the reconstruction map satisfies a local Lipschitz property giving explicit estimates for the Lipschitz constant depending on the dimension [Formula: see text] and the sampling effort while improving a bound on the assumed separation from [ 6 ]. With the Wasserstein distance as the metric on the space of measures we even conclude that weak SR is globally Lipschitz continuous and hence well-conditioned. Mathias Hockmann, Stefan Kunis |
SIAM J. Imaging Sci. | 1 |