Mittelstädt, SebastianBernard, JürgenSchreck, TobiasSteiger, MartinKohlhammer, JörnKeim, Daniel A.N. Elmqvist and M. Hlawitschka and J. Kennedy2014-12-162014-12-162014978-3-905674-69-9https://doi.org/10.2312/eurovisshort.20141163https://diglib.eg.org/handle/10.2312/eurovisshort.20141163.091-095Color is one of the most effective visual variables since it can be combined with other mappings and encodeinformation without using any additional space on the display. An important example where expressing additionalvisual dimensions is direly needed is the analysis of high-dimensional data. The property of perceptual linearity isdesirable in this application, because the user intuitively perceives clusters and relations among multi-dimensionaldata points. Many approaches use two-dimensional colormaps in their analysis, which are typically created byinterpolating in RGB, HSV or CIELAB color spaces. These approaches share the problem that the resulting colorsare either saturated and discriminative but not perceptual linear or vice versa. A solution that combines bothadvantages has been previously introduced by Kaski et al.; yet, this method is to date underutilized in InformationVisualization according to our literature analysis. The method maps high-dimensional data points into the CIELABcolor space by maintaining the relative perceived distances of data points and color discrimination. In this paper,we generalize and extend the method of Kaski et al. to provide perceptual uniform color mapping for visual analysisof high-dimensional data. Further, we evaluate the method and provide guidelines for different analysis tasks.I.3.6 [Computer Graphics]Methodology andTechniquesStandardsI.3.3 [Computer Graphics]Picture/Image GenerationDisplay AlgorithmsRevisiting Perceptually Optimized Color Mapping for High-Dimensional Data Analysis