Demo Data from EDBT 2026 / reviewers in the wild / expert
Peter F. M. Nacken
dblp:87/637
· DBLP profile ↗
5ranked-venue papers
3as first author
0since 2021 · last 1998
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-authorGraphics, 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
2 papers |
Image and video processing · 100% | |
| Theoretical computer science
1 paper |
Logic in computer science · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Image and video processing › mathematical morphology
morphological image processing |
0.0 | 1 | 1994 | Openings Can Introduce Zero Crossings in Boundary Curvature · IEEE Trans. Pattern Anal. Mach. Intell. 1994 |
Image and video processing
image segmentation |
0.0 | 1 | 1993 | A Metric for Line Segments · IEEE Trans. Pattern Anal. Mach. Intell. 1993 |
Image and video processing
edge detection |
0.0 | 1 | 1993 | A Metric for Line Segments · IEEE Trans. Pattern Anal. Mach. Intell. 1993 |
Methods — techniques the papers use, named apart from their topics
counterexample analysis · 0.0neighborhood functions · 0.0clustering · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | Segmentation Of 2D And 3D Images Through A Hierarchical Clustering Based On Region Modelling
Xinquan Shen, Michael Spann, Peter F. M. Nacken |
Pattern Recognit. | 3 |
| 1995 | Image segmentation by connectivity preserving relinking in hierarchical graph structures
Peter F. M. Nacken |
Pattern Recognit. | 1 |
| 1994 | Openings Can Introduce Zero Crossings in Boundary CurvatureabstractChen and Yan (1989) presented a result on zero crossings of boundary curvature under morphological openings. In this correspondence, it is shown, by means of a counter example, that this result is not correct. An analysis of the counter example shows where Chen and Yan go wrong and determines a class of images for which their theorem holds.> Peter F. M. Nacken |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 1993 | A Metric for Line SegmentsabstractThis correspondence presents a metric for describing line segments. This metric measures how well two line segments can be replaced by a single longer one. This depends for example on collinearity and nearness of the line segments. The metric is constructed using a new technique using so-called neighborhood functions. The behavior of the metric depends on the neighborhood function chosen. In this correspondence, an appropriate choice for the case of line segments is presented. The quality of the metric is verified by using it in a simple clustering algorithm that groups line segments found by an edge detection algorithm in an image. The fact that the clustering algorithm can detect long linear structures in an image shows that the metric is a good measure for the groupability of line segments.> Peter F. M. Nacken |
IEEE Trans. Pattern Anal. Mach. Intell. | 1 |
| 1992 | Graph morphology
Henk J. A. M. Heijmans, Peter F. M. Nacken, Alexander Toet, L. Vincent |
J. Vis. Commun. Image Represent. | 2 |