Periodic clustered-dot screens are widely used for electrophotographic printers due to their print stability. However, moiré is a ubiquitous problem that arises in color printing due to the beating together of the clustered-dot, periodic halftone patterns that are used to represent different colorants. The traditional solution in the graphic arts and printing industry is to rotate identical square screens to angles that are maximally separated from each other. However, the effectiveness of this approach is limited when printing with more than four colorants, i.e., N -color printing, where N > 4 . Moreover, accurately achieving the angles that have maximum angular separation requires a very high-resolution plate writer, as is used in commercial offset printing. Commercially available high-end digital printers cannot achieve this resolution. In this paper, we propose a systematic way to design color screen sets for periodic, clustered-dot screens that offer more explicit control of the moiré properties of the resulting screens when used in color printing. We develop a principled approach for the moiré-free screen design that is called lattice-based screen design. The basic concept behind our approach is the creation of the screen set on a 2D lattice in the frequency domain, and then picking each fundamental frequency vector of the individual colorant planes in the created spectral lattice according to the desired properties. The lattice-based screen design offers more flexibility in designing N -color screen sets with different halftone geometries, and all of them are guaranteed to be all-orders moiré-free. We demonstrate the efficacy of our proposed method by introducing several new screen designs, and a comparison with published screen designs.

In this paper, we present a new algorithm for aperiodic clustered-dot halftoning based on direct binary search (DBS). The DBS optimization framework has been modified for designing clustered-dot texture, by using filters with different sizes in the initialization and update steps of the algorithm. Following an intuitive explanation of how the clustered-dot texture results from this modified framework, we derive a closed-form cost metric which, when minimized, equivalently generates stochastic clustered-dot texture. An analysis of the cost metric and its influence on the texture quality is presented, which is followed by a modification to the cost metric to reduce computational cost and to make it more suitable for screen design.

Many relational operations are best performed when the relations are stored sorted over the relevant attributes (e.g. the common attributes in a natural join operation). However, generally relations are not stored sorted because it is expensive to maintain them this way (and impossible whenever there is more than one relevant sort key). Still, many times relations turn out to be nearly-sorted, where most tuples are close to their place in the order. This state can result from "leftover sortedness", where originally sorted relations were updated, or were combined into interim results when evaluating a complex query. It can also result from weak correlations between attribute values. Currently, nearly-sorted relations are treated the same as unsorted relations, and when relational operations are evaluated for them, a generic algorithm is used. Yet, many operations can be computed more efficiently by an algorithm that exploits this near-ordering.

Most electrophotographic printers use periodic, clustered-dot screening for rendering smooth and stable prints. However, when used for color printing, this approach suffers from the problem of periodic moire resulting from interference between the periodic halftones of individual color planes. There has been proposed an approach, called CLU-DBS for stochastic, clustered-dot halftoning and screen design based on direct binary search. We propose a methodology to embed a printer model within this halftoning algorithm to account for dot-gain and dot-loss effects. Without accounting for these effects, the printed image will not have the appearance predicted by the halftoning algorithm. We incorporate a measurement-based stochastic model for dot interactions of an electro-photographic printer within the iterative CLU-DBS binary halftoning algorithm. The stochastic model developed is based on microscopic absorptance and variance measurements. The experimental results show that electrophotography-model based stochastic clustered dot halftoning improves the homogeneity and reduces the graininess of printed halftone images.

Periodic clustered-dot screens are widely used for electrophotographic printers due to their homogeneous halftone texture and their robustness to dot gain. However, when applied to color printing, there are two important phenomena that limit the quality of printed color halftones generated using a screening technology: (1) moire´ due to the superposition halftone patterns corresponding to different periodicity matrices, and (2) appearance changes due to misregistration between different colorant planes. This paper focuses on analyzing the registration sensitivity of periodic, clustered-dot screens. To quantitatively measure the effect of registration errors, we introduce two new functions: (1) cost, and (2) risk of registration errors. We propose the notion of “visual equivalence”, and derive three propositions under which visual equivalence can be achieved, even when registration errors occur.

We introduce a new similarity measure that is insensitive to sub-pixel misregistration. The proposed measure is essential in some differences detection scenarios. For example, in a setting where a digital reference is compared to an image, where the imaging process introduces deformations that appear as non constant misregistration between the two images. Our goal is to ignore image differences that result from misregistration and detect only the true, albeit minute, defects. In order to define a misregistration insensitive similarity, we argue that a similarity measure must respect convex combinations. We show that the well known SSIM does not hold this property and propose a modified version of SSIM that respects convex combinations. We then use this measure to define Sub-Pixel misregistration aware SSIM (SPSSIM).