Demo Data from SIGIR 2026 / reviewers in the wild / expert
Leonid Kostrykin
dblp:220/1346
· DBLP profile ↗
2ranked-venue papers
2as first author
1since 2021 · last 2023
0000-0003-1323-3762ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author
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.
| Computer graphics and multimedia
1 paper |
Image and video processing · 67% Geometric modeling and processing · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Geometric modeling and processing › deformable models
deformable shape model |
0.7 | 1 | 2023 | Superadditivity and Convex Optimization for Globally Optimal Cell Segmentation Using Deformable Shape Models · IEEE Trans. Pattern Anal. Mach. Intell. 2023 |
Image and video processing
image segmentation |
0.7 | 1 | 2023 | Superadditivity and Convex Optimization for Globally Optimal Cell Segmentation Using Deformable Shape Models · IEEE Trans. Pattern Anal. Mach. Intell. 2023 |
Image and video processing › image segmentation › object segmentation
nuclei segmentation |
0.7 | 1 | 2023 | Superadditivity and Convex Optimization for Globally Optimal Cell Segmentation Using Deformable Shape Models · IEEE Trans. Pattern Anal. Mach. Intell. 2023 |
Methods — techniques the papers use, named apart from their topics
superadditivity · 0.7global energy minimization · 0.7convex optimization · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Superadditivity and Convex Optimization for Globally Optimal Cell Segmentation Using Deformable Shape ModelsabstractCell nuclei segmentation is challenging due to shape variation and closely clustered or partially overlapping objects. Most previous methods are not globally optimal, limited to elliptical models, or are computationally expensive. In this work, we introduce a globally optimal approach based on deformable shape models and global energy minimization for cell nuclei segmentation and cluster splitting. We propose an implicit parameterization of deformable shape models and show that it leads to a convex energy. Convex energy minimization yields the global solution independently of the initialization, is fast, and robust. To jointly perform cell nuclei segmentation and cluster splitting, we developed a novel iterative global energy minimization method, which leverages the inherent property of superadditivity of the convex energy. This property exploits the lower bound of the energy of the union of the models and improves the computational efficiency. Our method provably determines a solution close to global optimality. In addition, we derive a closed-form solution of the proposed global minimization based on the superadditivity property for non-clustered cell nuclei. We evaluated our method using fluorescence microscopy images of five different cell types comprising various challenges, and performed a quantitative comparison with previous methods. Our method achieved state-of-the-art or improved performance. Leonid Kostrykin, Karl Rohr |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 2019 | Globally optimal segmentation of cell nuclei in fluorescence microscopy images using shape and intensity information
Leonid Kostrykin, Christoph Schnörr, Karl Rohr |
Medical Image Anal. | 1 |