Clustered-Dot Halftoning With Direct Binary Search
Authors:
- 13 September 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 22 (2) , 473-487
Abstract
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.Keywords
This publication has 16 references indexed in Scilit:
- AM/FM halftoning: digital halftoning through simultaneous modulation of dot size and dot densityJournal of Electronic Imaging, 2004
- Digital halftoning with optimized dither array2002
- Minimizing stochastic moiré in frequency-modulated halftones by means of green-noise masksJournal of the Optical Society of America A, 2002
- A dual interpretation for direct binary search and its implications for tone reproduction and texture qualityIEEE Transactions on Image Processing, 2000
- Stochastic clustered-dot ditheringJournal of Electronic Imaging, 1999
- Digital halftoning by means of green-noise masksJournal of the Optical Society of America A, 1999
- Green-noise digital halftoningProceedings of the IEEE, 1998
- Spectral analysis and minimization of moire patterns in color separationJournal of Electronic Imaging, 1994
- Dithering with blue noiseProceedings of the IEEE, 1988
- A Survey of Electronic Techniques for Pictorial Image ReproductionIEEE Transactions on Communications, 1981