Share Email Print

Proceedings Paper

Convex reduction of calibration charts
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Calibration targets are widely used to characterize imaging devices and estimate optimal profiles to map the response of one device to the space of another. The question addressed in this paper is that of how many surfaces in a calibration target are needed to account for the whole target perfectly. To accurately answer this question we first note that the reflectance spectra space is closed and convex. Hence the extreme points of the convexhull of the data encloses the whole target. It is thus sufficient to use the extreme points to represent the whole set. Further, we introduce a volume projection algorithm to reduce the extremes to a user defined number of surfaces such that the remaining surfaces are more important, i.e. account for a larger number of surfaces, than the rest. When testing our algorithm using the Munsell book of colors of 1269 reflectances we found that as few as 110 surfaces were sufficient to account for the rest of the data and as few as 3 surfaces accounted for 86% of the volume of the whole set.

Paper Details

Date Published: 17 January 2005
PDF: 9 pages
Proc. SPIE 5667, Color Imaging X: Processing, Hardcopy, and Applications, (17 January 2005); doi: 10.1117/12.586304
Show Author Affiliations
Ali Alsam, Gjovik Univ. College (Norway)
Jon Y. Hardeberg, Gjovik Univ. College (Norway)

Published in SPIE Proceedings Vol. 5667:
Color Imaging X: Processing, Hardcopy, and Applications
Reiner Eschbach; Gabriel G. Marcu, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?