Bounds and algorithms for dither screens
@inproceedings{Gotsman1996BoundsAA, title={Bounds and algorithms for dither screens}, author={Craig Gotsman and Jan P. Allebach}, booktitle={Electronic imaging}, year={1996} }
A simple model for quantifying dither screen performance is proposed. Using this model, inherent limitations on the performance of dither screen halftoning are proved. An efficient method for generating quality dither screens, with good performance under our model, is presented.
6 Citations
Quality issues in blue noise halftoning
- Computer ScienceElectronic Imaging
- 1998
A new series of psycho-visual experiments address the 'preferred' color rendering among four different blue noise halftoning schemes and investigates the quality issues in blue-noise binary pattern design and mask generation as well as in application to color reproduction.
Barycentric Screening
- Computer Science
- 1999
This report develops a color dithering procedure based on a non-Cartesian coordinate system that allows the rendition of solid color patches while using no more than a preselected quadruple of colors, thereby enabling a reduction of halftone noise.
Halftone postprocessing for improved rendition of highlights and shadows
- Computer ScienceJ. Electronic Imaging
- 2000
The Springs algorithm is described, and results which demonstrate its effec- tiveness are shown, which are a simple dot-rearrangement heuristic which results in a more isotropic dot distribution.
New void-and-cluster method for improved halftone uniformity
- Computer ScienceJ. Electronic Imaging
- 1999
An improved dithering method using a Voronoi tessellation and three criteria to select among equally likely candidates for the locations of the largest voids and the tightest clusters is presented.
Color, style and composition in image processing
- Art
- 2007
This work proposes a concise, multiresolution image representation that can simultaneously support both photorealistic reconstruction and non-photorealistic rendering, and proposes recoloring techniques to remap colors, find and replace colors, and convert colors to grayscale.
Scattered data interpolation methods for electronic imaging systems: a survey
- MathematicsJ. Electronic Imaging
- 2002
The main methods reviewed include linear triangular (or tetrahedral) interpolation, cubic triangular (Clough-Tocher) interpo- lation, triangle based blending interpolations, inverse distance weighted methods, radial basis function methods, and natural neigh- bor interpolation methods.
References
SHOWING 1-10 OF 14 REFERENCES
Computer-aided design of dither signals for binary display of images.
- Computer ScienceApplied optics
- 1979
A computer-aided approach to the design of dither signals that uses a pairwise exchange algorithm to minimize a measure of susceptibility to aliasing is described.
Least-squares model-based halftoning
- Computer ScienceElectronic Imaging
- 1992
Experiments show that least-squares model-based halftoning produces more gray levels and better spatial resolution than conventional techniques, and shows that the least- squares approach eliminates the problems associated with error diffusion.
Digital halftoning using a blue-noise mask
- PhysicsElectronic Imaging
- 1991
The blue noise mask is constructed such that when thresholded at any level, the resulting binary pattern has the correct first order statistics, and also its power spectrum has blue noise (high frequency) characteristics which are visually pleasing.
Void-and-cluster method for dither array generation
- Computer ScienceElectronic Imaging
- 1993
A new method for generating homogeneous ordered dither arrays is presented, which can be used for strikingly high quality artifact-free dithering with relatively small arrays and compared with other ordered dithering and error diffusion-based techniques.
Principled halftoning based on human vision models
- Computer ScienceElectronic Imaging
- 1992
It is found that the principled approach can lead to a range of useful halftoning algorithms, as the authors trade off speed for quality by varying the complexity of the quality measure and the thoroughness of the search.
The farthest point strategy for progressive image sampling
- Computer ScienceProceedings of the 12th IAPR International Conference on Pattern Recognition, Vol. 2 - Conference B: Computer Vision & Image Processing. (Cat. No.94CH3440-5)
- 1994
A new method of "farthest point strategy" (FPS) for progressive image acquisition is presented, retaining its uniformity with the increased density, providing an efficient means for sparse image sampling and display.
Gotsman . Halftoning image sequences
- The Visual Computer
- 1993
Preparata and M.1. Shamos. Computational Geometry: An Introduction
- Preparata and M.1. Shamos. Computational Geometry: An Introduction
- 1985
An optimum method for two-level rendition of continuous-tone pictures
- Proceedings of IEEE Int!. Conf. on Comm
- 1973