The DOI matches its Crossref record.
Void-and-cluster method for dither array generation:
Abstract
Halftoning to two or more levels by means of ordered dither has always been attractive because of its speed and simplicity. However, the so-called recursive tessellation arrays in wide use suffer from strong periodic structure that imparts an unnatural appearance to resulting images. A new method for generating homogeneous ordered dither arrays is presented. A dither array is built by looking for voids and clusters in the intermediate patterns and relaxing them to optimize isotropy. While the method can be used for strikingly high quality artifact-free dithering with relatively small arrays, it is quite general; with different initial conditions the familiar recursive tessellation arrays can be built. This paper presents the algorithm for generating such arrays. Example images are compared with other ordered dither and error diffusion-based techniques.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Sharma, G., & Trussell, H. J. (1997) · IEEE Transactions on Image Processing · doi:10.1109/83.597268 · Cited by 440
Halftone Visual Cryptography Via Error Diffusion
Wang, Z., Arce, G. R., & Di Crescenzo, G. (2009) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2009.2024721 · Cited by 267
Metadata
- Authors
- Ulichney, R. A.
- Venue
- SPIE Proceedings
- Publisher
- SPIE
- Published
- 1993-09-08
- Volume
- 1913
- Pages
- 332-343
- ISSN
- 0277-786X (ISSN-L)
- OpenAlex
- W2005010120
- Cited by
- 192
- References
- 0
- FWCI
- 7.78
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Void-and-cluster method for dither array generation:. https://app.cochat.ai/papers/10.1117/12.152707
- The paper
- Ulichney, R. A. (1993). Void-and-cluster method for dither array generation:. SPIE Proceedings. https://doi.org/10.1117/12.152707
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.