Demo Data from EDBT 2026 / reviewers in the wild / expert
Frank Barthel
dblp:98/1405
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2008
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1
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 · 61% Geometric modeling and processing · 30% Multimedia analysis and retrieval · 9% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing
image segmentation |
0.1 | 1 | 2008 | Shape priors in variational image segmentation: Convexity, Lipschitz continuity and globally optimal solutions · CVPR 2008 |
Geometric modeling and processing › shape analysis
shape prior |
0.1 | 1 | 2008 | Shape priors in variational image segmentation: Convexity, Lipschitz continuity and globally optimal solutions · CVPR 2008 |
Image and video processing › image segmentation
variational segmentation |
0.1 | 1 | 2008 | Shape priors in variational image segmentation: Convexity, Lipschitz continuity and globally optimal solutions · CVPR 2008 |
Multimedia analysis and retrieval
object tracking |
0.0 | 1 | 2008 | Shape priors in variational image segmentation: Convexity, Lipschitz continuity and globally optimal solutions · CVPR 2008 |
Methods — techniques the papers use, named apart from their topics
level set representation · 0.1convex optimization · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2008 | Shape priors in variational image segmentation: Convexity, Lipschitz continuity and globally optimal solutionsabstractIn this work, we introduce a novel implicit representation of shape which is based on assigning to each pixel a probability that this pixel is inside the shape. This probabilistic representation of shape resolves two important drawbacks of alternative implicit shape representations such as the level set method: Firstly, the space of shapes is convex in the sense that arbitrary convex combinations of a set of shapes again correspond to a valid shape. Secondly, we prove that the introduction of shape priors into variational image segmentation leads to functionals which are convex with respect to shape deformations. For a large class of commonly considered (spatially continuous) functionals, we prove that - under mild regularity assumptions - segmentation and tracking with statistical shape priors can be performed in a globally optimal manner. In experiments on tracking a walking person through a cluttered scene we demonstrate the advantage of global versus local optimality. Daniel Cremers, Frank R. Schmidt, Frank Barthel |
CVPR | 3 |