Demo Data from EDBT 2026 / reviewers in the wild / expert
William D. Kalies
dblp:57/6730
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2006
0000-0002-8228-3598ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 2
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 |
Computational geometry · 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 |
|---|---|---|---|---|
Computational geometry
discrete geometry |
0.1 | 1 | 2006 | On the detection of simple points in higher dimensions using cubical homology · IEEE Trans. Image Process. 2006 |
Computational geometry
topological data analysis |
0.1 | 1 | 2006 | On the detection of simple points in higher dimensions using cubical homology · IEEE Trans. Image Process. 2006 |
Image and video processing › mathematical morphology
topology preserving thinning |
0.0 | 1 | 2006 | On the detection of simple points in higher dimensions using cubical homology · IEEE Trans. Image Process. 2006 |
Methods — techniques the papers use, named apart from their topics
homology groups · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2006 | On the detection of simple points in higher dimensions using cubical homologyabstractSimple point detection is an important task for several problems in discrete geometry, such as topology preserving thinning in image processing to compute discrete skeletons. In this paper, the approach to simple point detection is based on techniques from cubical homology, a framework ideally suited for problems in image processing. A (d-dimensional) unitary cube (for a d-dimensional digital image) is associated with every discrete picture element, instead of a point in epsilon(d) (the d-dimensional Euclidean space) as has been done previously. A simple point in this setting then refers to the removal of a unitary cube without changing the topology of the cubical complex induced by the digital image. The main result is a characterization of a simple point p (i.e., simple unitary cube) in terms of the homology groups of the (3d - 1) neighborhood of p for arbitrary, finite dimensions Marc Niethammer, William D. Kalies, Konstantin Mischaikow, Allen R. Tannenbaum |
IEEE Trans. Image Process. | 2 |
| 2002 | Analysis of blood vessel topology by cubical homologyabstractWe segment and topologically classify brain vessel data obtained from magnetic resonance angiography (MRA). The segmentation is done adaptively and the classification by means of cubical homology, i.e. the computation of homology groups. In this way the number of connected components; (measured by H/sub 0/), the tunnels (given by H/sub 1/) and the voids (given by H/sub 2/) are determined, resulting in a topological characterization of the blood vessels. Konstantin Mischaikow, Pawel Pilarczyk, William D. Kalies, Marc Niethammer, Andrew Stein, Allen R. Tannenbaum |
ICIP (2) | 3 |