Continuity of gamut mapping algorithms

The design of a gamut mapping algorithm (GMA) is always a compromise between preserving different competing aspects such as color, contrast and lightness. A natural requirement to a GMA is that the algorithmic treatment of this competition has to avoid any additional artefacts such as discontinuities or loss of contrast. In this paper several common gamut mapping algorithms are studied from this aspect, resulting in the observation that problems with geometric discontinuities are widespread. For the assessment of the phenomena induced by local mapping properties, an algorithmic test was developed and applied. This new test supports both, the quality check of existing as well as the development of new GMAs. Finally we present a first new algorithm designed to have a good behavior concerning continuity and contrast conservation which also performs well in classical psychophysical tests.