@inproceedings{Ostromoukhov:2001:ASE,
  optnote = {},
  author = {Victor Ostromoukhov},
  optkey = {},
  series = CGPACS,
  optannote = {},
  editor = {Eugene Fiume},
  url = {http://www.iro.umontreal.ca/~ostrom/publications/abstracts.html#SIGGRAPH01_VarcoeffED},
  address = {New York},
  localfile = {papers/Ostromoukhov.2001.ASE.pdf},
  optpublisher = {},
  doi = {http://doi.acm.org/10.1145/383259.383326},
  optmonth = {},
  organization = {ACM SIGGRAPH},
  citeseer = {http://citeseer.nj.nec.com/510222.html},
  optcrossref = {},
  booktitle = SIGGRAPH2001,
  optstatus = {OK},
  optvolume = {},
  optnumber = {},
  title = {{A} {S}imple and {E}fficient {E}rror-{D}iffusion {A}lgorithm},
  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.},
  year = {2001},
  pages = {567--572},
}