Laplacian colormaps: a framework for structure-preserving color transformations

Mappings between color spaces are ubiquitous in image processing problems such as gamut mapping, decolorization, and image optimization for color‐blind people. Simple color transformations often result in information loss and ambiguities, and one wishes to find an image‐specific transformation that...

Full description

Saved in:
Bibliographic Details
Published inComputer graphics forum Vol. 33; no. 2; pp. 215 - 224
Main Authors Eynard, D., Kovnatsky, A., M. Bronstein, M.
Format Journal Article
LanguageEnglish
Published Oxford Blackwell Publishing Ltd 01.05.2014
Subjects
Online AccessGet full text

Cover

Loading…
More Information
Summary:Mappings between color spaces are ubiquitous in image processing problems such as gamut mapping, decolorization, and image optimization for color‐blind people. Simple color transformations often result in information loss and ambiguities, and one wishes to find an image‐specific transformation that would preserve as much as possible the structure of the original image in the target color space. In this paper, we propose Laplacian colormaps, a generic framework for structure‐preserving color transformations between images. We use the image Laplacian to capture the structural information, and show that if the color transformation between two images preserves the structure, the respective Laplacians have similar eigenvectors, or in other words, are approximately jointly diagonalizable. Employing the relation between joint diagonalizability and commutativity of matrices, we use Laplacians commutativity as a criterion of color mapping quality and minimize it w.r.t. the parameters of a color transformation to achieve optimal structure preservation. We show numerous applications of our approach, including color‐to‐gray conversion, gamut mapping, multispectral image fusion, and image optimization for color deficient viewers.
Bibliography:istex:35CE0FDDE12F7B7FD8D9E2277C72911CFFA470AB
ark:/67375/WNG-K5QGLF3M-G
ArticleID:CGF12295
Supporting Information
ij
More generally, the ‘radiometric’ part of the adjacency
does not have to work on pixel‐wise colors, and one can consider some local features, the simplest of which are patches
WK12
.
w
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12295