Demo Data from SIGIR 2026 / reviewers in the wild / expert
Dmitry A. Storchak
dblp:382/6500
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2017
0000-0002-1481-801XORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Graphics, 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 |
Visualization and visual analytics · 77% Image and video processing · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Visualization and visual analytics › visual encoding
colormap design |
0.3 | 1 | 2017 | Categorical Colormap Optimization with Visualization Case Studies · IEEE Trans. Vis. Comput. Graph. 2017 |
Image and video processing › color image processing
perceptual color distance |
0.1 | 1 | 2017 | Categorical Colormap Optimization with Visualization Case Studies · IEEE Trans. Vis. Comput. Graph. 2017 |
Methods — techniques the papers use, named apart from their topics
perceptual distance maximization · 0.3optimization with constraints · 0.3
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2017 | Categorical Colormap Optimization with Visualization Case StudiesabstractMapping a set of categorical values to different colors is an elementary technique in data visualization. Users of visualization software routinely rely on the default colormaps provided by a system, or colormaps suggested by software such as ColorBrewer. In practice, users often have to select a set of colors in a semantically meaningful way (e.g., based on conventions, color metaphors, and logological associations), and consequently would like to ensure their perceptual differentiation is optimized. In this paper, we present an algorithmic approach for maximizing the perceptual distances among a set of given colors. We address two technical problems in optimization, i.e., (i) the phenomena of local maxima that halt the optimization too soon, and (ii) the arbitrary reassignment of colors that leads to the loss of the original semantic association. We paid particular attention to different types of constraints that users may wish to impose during the optimization process. To demonstrate the effectiveness of this work, we tested this technique in two case studies. To reach out to a wider range of users, we also developed a web application called Colourmap Hospital. Hui Fang 0003, Simon J. Walton, Emily Delahaye, Dmitry A. Storchak, Min Chen 0001 |
IEEE Trans. Vis. Comput. Graph. | 5 |