A 2-D pulse density modulation by iteration for halftoning

Eschbach, Reiner; Hauck, R.

doi:10.1016/0030-4018(87)90294-x

Cited by 17 publications

(5 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nevertheless, these algorithms usually suffer from two big drawbacks: they are too computationally costly to be implemented in simple and fast visualization software (e.g. see Eschbach's pulse-density modulation [5], Allebach's direct binary search-based halftoning [2,14], or Marcu's roadmap [15]), and they are often proprietary, which considerably limits their potential application for the computer graphics community. The best implementation of the DBS-based halftoning is approximately 10 times slower than a typical error-diffusion, according to Jan Allebach's estimation [1].…”

Section: Introductionmentioning

confidence: 99%

A simple and efficient error-diffusion algorithm

Ostromoukhov

2001

Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques

163

131

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

A simple and efficient error-diffusion algorithm

Ostromoukhov

2001

Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques

163

131

View full text Add to dashboard Cite

show abstract

“…1 The earliest use of an iterative method to directly render a continuous-tone image appears to be the work of Carnevali et al 11 in 1985. This was followed in 1987 by Eschbach and Hauck's work with the interconnected springs model. 23 After a brief lull, the area became extremely active in the early 90s. In 1991, Kollias and Anastassiou 12 and Bernard 13 proposed the use of neural networks, Pappas and Neuhoff 14 suggested the Viterbi algorithm, and Zakhor et al 18 used a linear programming approach.…”

Section: Introductionmentioning

confidence: 99%

“…Wong 22 has shown that frequency weighted mean-squared error does not always decrease with increasing texture uniformity. Other cost functions include a measure of the potential energy stored in an interconnected mesh of springs 23,24 and measures for texture quality. 21,[25][26][27] The cost function has also been based on nonlinear scale spaces.…”

Section: Introductionmentioning

confidence: 99%

“…6,7 The search for the halftone textures or threshold matrix has been cast in a number of different frameworks. Methods used to find the extremum of a metric include simulated annealing, 11 iterated conditional modes, 23 neural networks, 12,13 linear programming, 19 the Viterbi algorithm, 14 a dynamical system model in the form of a reactiondiffusion, 21 genetics algorithms, 5,31 and various heuristic strategies, 2,[15][16][17]20,[24][25][26] including pairwise exchange 1 and generalized Russian roulette. 27 To simultaneously satisfy spatial and transform domain constraints, variations of the Gerchberg-Saxton iteration 32 have been employed.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

<title>DBS: retrospective and future directions</title>

Allebach

2000

SPIE Proceedings

View full text Add to dashboard Cite

The direct binary search (DBS) algorithm is one of a family of iterative approaches to signal design. DBS is characterized by a particular search strategy and an efficient approach to evaluating the effect of trial changes. From its origins as a method for synthesis of digital holograms, we trace the evolution of DBS to its current state as a powerful and flexible method for digital halftoning and a tool for development of derivative algorithms for digital halftoning. We describe the theory that underpins how DBS behaves, and discuss in some detail the use of printer models within DBS. Finally, we describe briefly the application of DBS to color halftoning and its use to design halftone screens, a lookup table based algorithm, aperiodic microscreens, and halftones with an embedded watermark.

show abstract

“…The main goal is to transform a diverse form of images into binary format. The ED is one of half-toning methods, where ED is categorized as region operation (or pixel operation) [7][8][9][10][11][12][13][14][15][16][17][18][19][20][21][22][23]. Therefore, parallel processing is possible and buffer is required for this process.…”

Section: Introductionmentioning

confidence: 99%