Demo Data from EDBT 2026 / reviewers in the wild / expert
Kirk A. Dunkelberger
dblp:182/1596
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 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 |
Multimedia analysis and retrieval · 38% Image and video processing · 38% Geometric modeling and processing · 12% |
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 › edge detection
edge tracing |
0.0 | 1 | 1985 | Contour tracing for precision measurement · ICRA 1985 |
Multimedia analysis and retrieval
image analysis |
0.0 | 1 | 1985 | Contour tracing for precision measurement · ICRA 1985 |
Image and video coding › shape coding
chain code |
0.0 | 1 | 1985 | Contour tracing for precision measurement · ICRA 1985 |
Geometric modeling and processing › computational geometry
digital geometry |
0.0 | 1 | 1985 | Contour tracing for precision measurement · ICRA 1985 |
Methods — techniques the papers use, named apart from their topics
table lookup · 0.0parallel preprocessing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Contour tracing for precision measurementabstractCurrent methods of contour tracing are based on chain code concepts which require movement from the center of a pixel to the center of a four- or eight-connected neighbor. They are basically serial processes requiring memory and decision structures based on the connectedness of the objects and the direction of the trace. A chain code method is proposed here which moves along the edge midpoints of pixels, increasing the number of contour samples. This new tracing process needs no memory, lends itself to fast table lookup implementation, uses only two tables for all connectedness rules and trace directions, and permits parallel preprocessing. The resulting chain code is nearer the true contour than any previous digital contour tracing method. Methods for conversion between the standard chain code and the new edge chain code are also presented. Kirk A. Dunkelberger, Owen Robert Mitchell |
ICRA | 1 |