skip to main content
10.1145/383259.383326acmconferencesArticle/Chapter ViewAbstractPublication PagessiggraphConference Proceedingsconference-collections
Article

A simple and efficient error-diffusion algorithm

Published:01 August 2001Publication History

ABSTRACT

In this contribution, we introduce a new error-diffusion scheme that produces higher quality results. The algorithm is faster than the universally used Floyd-Steinberg algorithm, while maintaining its original simplicity. The efficiency of our algorithm is based on a deliberately restricted choice of the distribution coefficients. Its pleasing nearly artifact-free behavior is due to the off-line minimization process applied to the basic algorithm's parameters (distribution coefficients). This minimization brings the Fourier spectra of the selected key intensity levels as close as possible to the corresponding “blue noise” spectra. The continuity of the algorithm's behavior across the full range of intensity levels is achieved thanks to smooth interpolation between the distribution coefficients corresponding to key levels. This algorithm is applicable in a wide range of computer graphics applications, where a color quantization algorithm with good visual properties is needed.

References

  1. 1.J. P. Allebach. Private communication, 2001.Google ScholarGoogle Scholar
  2. 2.M. Analoui and J. P. Allebach. Model based halftoning using direct binary search. SPIE, 1666:96-108, 1992.Google ScholarGoogle Scholar
  3. 3.B. E. Bayer. An optimum method for two-level rendition of continuous-tone pictures. IEEE Intl. Conf. on Communications, 1:2611-2615, 1973.Google ScholarGoogle Scholar
  4. 4.R. Eschbach. Reduction of artifacts in error diffusion by mean of inputdependent weights. JEI, 2(4):352-358, 1993.Google ScholarGoogle Scholar
  5. 5.R. Eschbach and R. Hauck. A 2-D pulse density modulation by iteration for halftoning. Optics Communications, 62(5):300-304, 1987.Google ScholarGoogle ScholarCross RefCross Ref
  6. 6.R. Eschbach and K. T. Knox. Error-diffusion algorithm with edge enhancement. JOSA (A), 8(12):1844-1850, 1991.Google ScholarGoogle ScholarCross RefCross Ref
  7. 7.R. W. Floyd and L. Steinberg. An adaptive algorithm for spatial grey scale. Proc. Soc. Inf. Display, 17:75-77, 1976.Google ScholarGoogle Scholar
  8. 8.L. Golland and K. Sigmund. Exact thought in a demented time: Karl Menger and his viennese mathematical colloquium. Math. Intelligencer, 22(1):34-45, 2000.Google ScholarGoogle ScholarCross RefCross Ref
  9. 9.J. F. Jarvis, C. N. Judice, and W. H. Ninke. A survey of techniques for the display of continuous tone pictures on bilevel displays. Computer Graphics and Image Processing, 5:13-40, 1976.Google ScholarGoogle ScholarCross RefCross Ref
  10. 10.H.R. Kang. Digital Color Halftoning. SPIE Press, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. 11.K. T. Knox. Edge enhancement in error diffusion. In Advance Printing of Paper Summaries, SPSE's 42nd Annual Conference, pages 310-313, Boston, MA, May 1989.Google ScholarGoogle Scholar
  12. 12.K. T. Knox. Error diffusion: A theoretical view. SPIE, 1913:326-331, 1993.Google ScholarGoogle Scholar
  13. 13.K. T. Knox. Evolution of error diffusion. JEI, 8(4):422-429, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  14. 14.D. J. Lieberman and J. P. Allebach. A dual interpretation for direct binary search and its implications for tone reproduction and texture quality. IEEE Trans. on Image Processing, 9:1950-1963, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. 15.G. Marcu. An error diffusion algorithm with output position constraints for homogeneous highlights and shadow dot distribution. JEI, 9(1):46-51, 2000.Google ScholarGoogle Scholar
  16. 16.T. Mitsa and K. J. Parker. Digital halftoning using a blue-noise mask. Journal of the Optical Society of America A, 9(11):1920-1929, 1992.Google ScholarGoogle ScholarCross RefCross Ref
  17. 17.V. Ostromoukhov, R. D. Hersch, and I. Amidror. Rotated dispersion dither: a new technique for digital halftoning. Proceedings of SIGGRAPH 94, pages 123- 130, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. 18.W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling. Numerical Recipes. Cambridge University Press, 1989.Google ScholarGoogle Scholar
  19. 19.C. I. Rosenberg. Measurement-based evaluation of a printer dot model for halftone algorithm tone correction. JEI, 2(3):205-212, 1993.Google ScholarGoogle Scholar
  20. 20.J. Shiau and Z. Fan. Method for quantization gray level pixel data with extended distribution set, 1994. US patent 5,353,127.Google ScholarGoogle Scholar
  21. 21.J. Shiau and Z. Fan. A set of easily implementable coefficients in error diffusion with reduced worm artifacts. SPIE, 2658:222-225, 1996.Google ScholarGoogle Scholar
  22. 22.P. Stucki. Mecca-a multiple-error correcting computation algorithm for bilevel image hardcopy reproduction, 1981. Research Report RZ1060, IBM Res. Lab.Google ScholarGoogle Scholar
  23. 23.R. Ulichney. Digital Halftoning. MIT Press, 1987. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. 24.R. Ulichney. The void-and-cluster method for dither array generation. SPIE, 1913:332-343, 1993.Google ScholarGoogle Scholar
  25. 25.R. Ulichney. A review of halftoning techniques. SPIE, 3963:378-391, 2000.Google ScholarGoogle Scholar
  26. 26.L. Velho and J. Gomes. Digital halftoning with space filling curves. Computer Graphics (Proceedings of SIGGRAPH 91), 25(4):81-90, 1991. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 27.L. Velho and J. Gomes. Stochastic screening dithering with adaptive clustering. Proceedings of SIGGRAPH 95, pages 273-276, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. 28.I. H. Witten and R. M. Neal. Using peano curves for bilevel display of continuous-tone images. IEEE Computer Graphics & Appl., 2:47-52, 1982.Google ScholarGoogle Scholar

Index Terms

  1. A simple and efficient error-diffusion algorithm

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SIGGRAPH '01: Proceedings of the 28th annual conference on Computer graphics and interactive techniques
      August 2001
      600 pages
      ISBN:158113374X
      DOI:10.1145/383259

      Copyright © 2001 ACM

      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 August 2001

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      SIGGRAPH '01 Paper Acceptance Rate65of300submissions,22%Overall Acceptance Rate1,822of8,601submissions,21%

      Upcoming Conference

      SIGGRAPH '24

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader