2013
DOI: 10.1109/tip.2012.2218821
|View full text |Cite
|
Sign up to set email alerts
|

Clustered-Dot Halftoning With Direct Binary Search

Abstract: In this paper, we present a new algorithm for aperiodic clustered-dot halftoning based on direct binary search (DBS). The DBS optimization framework has been modified for designing clustered-dot texture, by using filters with different sizes in the initialization and update steps of the algorithm. Following an intuitive explanation of how the clustered-dot texture results from this modified framework, we derive a closed-form cost metric which, when minimized, equivalently generates stochastic clustered-dot tex… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
13
0

Year Published

2014
2014
2022
2022

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 30 publications
(13 citation statements)
references
References 16 publications
0
13
0
Order By: Relevance
“…Because cpp[0] > c (k) pp , we should consider only toggle operation until the solution converges before we consider swap operation to achieve faster convergence. The fact that swap operation converges much slower than toggle operation has also been observed in previous researches [16]. The second observation is that c (1) pp determines the range of cpẽ[m] and a swap with a pixel further away from the center of the filter results in a smaller range.…”
Section: Monotonically Non-decreasing Swap Dbs Algorithmmentioning
confidence: 59%
See 3 more Smart Citations
“…Because cpp[0] > c (k) pp , we should consider only toggle operation until the solution converges before we consider swap operation to achieve faster convergence. The fact that swap operation converges much slower than toggle operation has also been observed in previous researches [16]. The second observation is that c (1) pp determines the range of cpẽ[m] and a swap with a pixel further away from the center of the filter results in a smaller range.…”
Section: Monotonically Non-decreasing Swap Dbs Algorithmmentioning
confidence: 59%
“…If convergence is established after the k-th swap, the opposite of either (16) or (17) must be satisfied so that no further swap is accepted. Therefore, one of the following two inequalities must be satisfied:…”
Section: Theoretical Analysismentioning
confidence: 99%
See 2 more Smart Citations
“…More recently, a clustered-dot halftone technique based on direct binary search was proposed. 11 Although the proposed technique does allow control of halftone shape and texture parameters, such as homogeneity and clusteredness, the technique only allows indirect control of these attributes via the adjustment of filter sizes.…”
Section: Introductionmentioning
confidence: 99%