In this paper, we develop a model-based color halftoning method using the direct binary search (DBS) algorithm. Our method strives to minimize the perceived error between the continuous tone original color image and the color halftone image. We exploit the differences in how the human viewers respond to luminance and chrominance information and use the total squared error in a luminance/chrominance based space as our metric. Starting with an initial halftone, we minimize this error metric using the DBS algorithm. Our method also incorporates a measurement based color printer dot interaction model to prevent the artifacts due to dot overlap and to improve color texture quality. We calibrate our halftoning algorithm to ensure accurate colorant distributions in resulting halftones. We present the color halftones which demonstrate the efficacy of our method.

We take a spectral model based approach to the problem of color prediction of halftones. Our approach assumes no scattering through the colorant layers and models the surface and subsurface scattering in the paper substrate by a parametric closed form point spread function. Given a halftone bitmap, we synthesize a high-resolution halftone microstructure image assuming dot profiles with Gaussian roll-offs, from which we compute a high-resolution transmission image. We then convolve this transmission image with the point spread function of the paper substrate to predict the average spectral distribution of the halftone. We use the spectral distribution measurements made by a spectrophotometer to train our model be. To iterate over a set of values For the two parameters of our model: the parameter for the point spread function of the paper substrate and the proportionality constant to obtain the transmittance of the colorant layer from the colorant dot count and the absorption spectrum of the colorant. Preliminary experimental results show the efficacy of our method.

A wavelet decomposition based surface compression technique to represent the forward transformation for a color printer is presented. The method creates a multi-scale grid structure for a given maximum pointwise error threshold. The error performance, the memory requirement, and the computational cost of this technique are compared with those of minimax sequential linear interpolation (SLI) and minimum mean-squared (MMSE) SLI.

We derive a closed form solution to the problem of finding an optimal grid structure for sequential linear interpolation (SLI) of a 3-D function. The criterion of optimality is to minimize the maximum absolute interpolation error. The approach we take is to equate the interpolation error within each interpolated cell. We compare the performance of our method with that of a previously developed iterative method.