Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Integer programming for optimal reduction of calibration targets

Integer programming for optimal reduction of calibration targets Calibration targets are widely used to characterize imaging devices. The question addressed in this article is that of how many surfaces in a calibration target are needed to account for the performance of the whole target. Different to previous research where the problem of reducing calibration charts is addressed independently of the calibration problem; in this article we tackle the reduction question based on the calibration performance. We argue that the outcome of both spectral and colorimetric calibration is dependent on the properties of the cross‐product matrix encompassing the color‐signals. Further, we show that by careful mathematical manipulation it is possible to write the cross‐product matrix as a linear sum of the submatrices corresponding to each individual color signal. This formulation allows us to cast the reduction problem as a quadratic minimization where we ask: given the spectral properties of the available color signals, what is the minimum number of surfaces needed to emulate the global cross‐product matrix. To reduce the number of surfaces we impose an integer constraint on the minimization, where the weight of each surface can only assume a value of 1 or 0. Our results show that around 13 surfaces are sufficient to account of the 24 surfaces of the Macbeth color checker. © 2008 Wiley Periodicals, Inc. Col Res Appl, 33, 212–220, 2008 http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Color Research & Application Wiley

Integer programming for optimal reduction of calibration targets

Alsam, Ali; Finlayson, Graham
Color Research & Application , Volume 33 (3) – Jun 1, 2008
Download PDF
9 pages

Loading next page...
 
/lp/wiley/integer-programming-for-optimal-reduction-of-calibration-targets-Se0T9jqAt8

References (18)

Publisher
Wiley
Copyright
Copyright © 2008 Wiley Periodicals, Inc.
ISSN
0361-2317
eISSN
1520-6378
DOI
10.1002/col.20402
Publisher site
See Article on Publisher Site

Abstract

Calibration targets are widely used to characterize imaging devices. The question addressed in this article is that of how many surfaces in a calibration target are needed to account for the performance of the whole target. Different to previous research where the problem of reducing calibration charts is addressed independently of the calibration problem; in this article we tackle the reduction question based on the calibration performance. We argue that the outcome of both spectral and colorimetric calibration is dependent on the properties of the cross‐product matrix encompassing the color‐signals. Further, we show that by careful mathematical manipulation it is possible to write the cross‐product matrix as a linear sum of the submatrices corresponding to each individual color signal. This formulation allows us to cast the reduction problem as a quadratic minimization where we ask: given the spectral properties of the available color signals, what is the minimum number of surfaces needed to emulate the global cross‐product matrix. To reduce the number of surfaces we impose an integer constraint on the minimization, where the weight of each surface can only assume a value of 1 or 0. Our results show that around 13 surfaces are sufficient to account of the 24 surfaces of the Macbeth color checker. © 2008 Wiley Periodicals, Inc. Col Res Appl, 33, 212–220, 2008

Journal

Color Research & Application – Wiley

Published: Jun 1, 2008

There are no references for this article.