Paper
22 April 1996 Mean-matching halftoning on a rotated quad-tree structure
Author Affiliations +
Proceedings Volume 2657, Human Vision and Electronic Imaging; (1996) https://doi.org/10.1117/12.238742
Event: Electronic Imaging: Science and Technology, 1996, San Jose, CA, United States
Abstract
We describe a new halftoning algorithm that uses a multiscale dot distribution procedure over a rotated quad-tree structure. The algorithm ensures that the average graylevel of the grayscale image over any node of the rotated quad-tree is equal to that of the halftone at the same node. This is achieved by first deciding the total number of black and white dots to be placed over the entire halftone, and then distributing the dots recursively to the subregions represented by the nodes of the rotated quad-tree.
© (1996) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Ping Wah Wong "Mean-matching halftoning on a rotated quad-tree structure", Proc. SPIE 2657, Human Vision and Electronic Imaging, (22 April 1996); https://doi.org/10.1117/12.238742
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Halftones

Nonimpact printing

Binary data

Calculus

Diffusion

Human vision and color perception

Image resolution

RELATED CONTENT

Color diffusion: error diffusion for color halftones
Proceedings of SPIE (December 22 1998)
Optimal halftoning over hexagonal grids
Proceedings of SPIE (January 16 2006)
New methods for digital halftoning and inverse halftoning
Proceedings of SPIE (December 28 2001)
Model-based halftoning using direct binary search
Proceedings of SPIE (August 27 1992)
Error diffusion techniques for printing fingerprint images
Proceedings of SPIE (January 28 1997)

Back to Top