Rating Tone-Mapping Algorithms for Gradations
The real scene consisted of a wide wall receiving controlled illumination. The test consisted of two horizontal gradations of grey with different gamma values, embedded in an achromatic noise background of high spatial frequency. Each observer was invited to choose the gradation he found “optimal”. The simulation was produced on a calibrated CRT display. Four tonemapping algorithms were implemented, three of which were linear, to render the simulated conditions.
With the real scene, observers are able to judge accurately which gradation is the best representative of the optimal gamma. Under examination of the distribution of preferred choice around the optimal gamma, it seems that the rating of gamma values is about symmetric on a logarithmic gamma scale.
The hypothesis is that a tone-mapping algorithm which performs well should yield the same optimal gamma as in the reality. After our experiments, it appears that the four algorithms which were tested fall in two classes, either under- or over-estimating the gamma values. Despite inter-observer variability, observers agree on their judgement.
Document Type: Research Article
Publication date: January 1, 2002
Started in 2002 and merged with the Color and Imaging Conference (CIC) in 2014, CGIV covered a wide range of topics related to colour and visual information, including color science, computational color, color in computer graphics, color reproduction, volor vision/psychophysics, color image quality, color image processing, and multispectral color science. Drawing papers from researchers, scientists, and engineers worldwide, DGIV offered attendees a unique experience to share with colleagues in industry and academic, and on national and international standards committees. Held every year in Europe, DGIV papers were more academic in their focus and had high student participation rates.
Please note: For purposes of its Digital Library content, IS&T defines Open Access as papers that will be downloadable in their entirety for free in perpetuity. Copyright restrictions on papers vary; see individual papers for details.
- Information for Authors
- Submit a Paper
- Subscribe to this Title
- Membership Information
- Terms & Conditions
- Ingenta Connect is not responsible for the content or availability of external websites