Colormap optimization with data equality
- PDF / 3,028,711 Bytes
- 13 Pages / 595.276 x 790.866 pts Page_size
- 59 Downloads / 179 Views
R E G UL A R P A P E R
Xiaohui Wang
•
Jiawei Yin • Bowen Cheng • Jingyan Qin
Colormap optimization with data equality
Received: 29 June 2020 / Revised: 7 August 2020 / Accepted: 8 August 2020 Ó The Visualization Society of Japan 2020
Abstract Colormap is a visualization tool to realize the mapping from data to colors. The data patterns can be revealed by color distribution, and the data details can be explored by the mapping. Most colormaps use a linear mapping between data and colors. When the data are unevenly distributed, most data samples are encoded in very few colors, so that the patterns hidden in these huge amount of data samples encoded by very small range of colors cannot be explored. Every data sample is equally important, it should map to the exclusive color in the colormap. Inspired by force-directed model-based node layout in network visualization, we propose a novel colormap optimization algorithm with data equality, called spring model-based colormap. It formulates the proposed proportionality rule and data ink rule by a dynamically balanced spring system. The proportionality rule is that the color perception difference is proportional to the values of data samples for better identification of data values. The data ink rule lets the spring system make colors associated with data samples as separate as possible in the color space for better data distribution reveal. To accelerate the colormap generation, a fast solution for the colormap optimization algorithm is proposed. The effectiveness of our method is evaluated by eye tracking experiments. The results show that the fixations on both our colormap and the encoded visualization are more dispersed, which indicates that our method is better at both data distribution reveal and identification of data values. Keywords Colormap Spring model Data equality Data distribution
1 Introduction Colormap is an important visualization method to realize the mapping from data to colors, which is commonly used in computer graphics, image processing, pattern recognition. The task of colormap optimization is to find an appropriate color mapping function f: D ! C that maps the data values D to the color set C in a color space. The data patterns can be revealed by color distribution, and the data details can be explored by the mapping.
X. Wang J. Qin (&) School of Mechanical Engineering, University of Science and Technology Beijing, Beijing, China E-mail: [email protected] X. Wang E-mail: [email protected] J. Yin School of Computer and Communication Engineering, University of Science and Technology Beijing, Beijing, China B. Cheng School of Mathematics and Physics, University of Science and Technology Beijing, Beijing, China
X. Wang et al.
There is no best colormap for all dataset (Tominski et al. 2008). Most colormaps use a linear mapping between the range of data values and the color range (Pizer et al. 1983; Trumbo 1981), such as rainbow colormaps. When the data are unevenly distributed, most data samples are encoded by very few colors.
Data Loading...
