๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Integer programming for optimal reduction of calibration targets

โœ Scribed by Ali Alsam; Graham Finlayson


Book ID
102809234
Publisher
John Wiley and Sons
Year
2008
Tongue
English
Weight
833 KB
Volume
33
Category
Article
ISSN
0361-2317

No coin nor oath required. For personal study only.

โœฆ Synopsis


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


๐Ÿ“œ SIMILAR VOLUMES


Nonlinear integer programming for optima
โœ Kurt M. Bretthauer; Anthony Ross; Bala Shetty ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 139 KB

A stratiยฎed random sampling plan is one in which the elements of the population are ยฎrst divided into nonoverlapping groups, and then a simple random sample is selected from each group. In this paper, we focus on determining the optimal sample size of each group. We show that various versions of thi