Algorithms and procedures for digital halftone generation

Peter Stucki

doi:10.1117/12.2322237

1 May 1992 Algorithms and procedures for digital halftone generation

Peter Stucki

Proceedings Volume 1670, Color Hard Copy and Graphic Arts; (1992) https://doi.org/10.1117/12.2322237
Event: SPIE/IS&T 1992 Symposium on Electronic Imaging: Science and Technology, 1992, San Jose, CA, United States

Abstract

The properties of conventional, ordered dot-pattern generation techniques for bi-level halftone representation are examined and compared with the properties of error-diffusion based, disordered dotpattern generation algorithms. The various processing steps necessary for the adaptation of the disordered halftone pattern-generation technique to digital image hardcopy reproduction with non-ideal computer- output printing devices are described. It includes procedures for spatial distribution of thresholding errors, suppression of dot-density artifacts and compensation for dot overlap. These procedures represent the core of the Multiple-Error Correction Computation Algorithm (MECCA), the objective of which is to linearize the non-ideal printing process to minimize the loss or shift of tonal gradations

Citation Download Citation

Peter Stucki "Algorithms and procedures for digital halftone generation", Proc. SPIE 1670, Color Hard Copy and Graphic Arts, (1 May 1992); https://doi.org/10.1117/12.2322237

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available