Puneet Goyal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Puneet Goyal has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
Carl Staelin
Google Advanced Technology Center, Technion City, Israel
2 shared publicationsMadhur Gupta
AT&T Services, Inc., San Ramon, CA, USA
2 shared publicationsMani Fischer
Hewlett-Packard Laboratories Israel, Technion City, Israel
2 shared publicationsOmri Shacham
HP Indigo Ltd., Ness Ziona, Israel
2 shared publicationsJan Allebach
Purdue Univ. (United States)
1 shared publicationJan P. Allebach
Purdue University, West Lafayette, IN, USA
1 shared publication
Latest Publications
- 13 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 22 (2) , 473-487
Clustered-Dot Halftoning With Direct Binary Search
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 texture. An analysis of the cost metric and its influence on the texture quality is presented, which is followed by a modification to the cost metric to reduce computational cost and to make it more suitable for screen design.
- 13 September 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Image Processing
- Vol. 22 (2) , 473-487
Clustered-Dot Halftoning With Direct Binary Search
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 texture. An analysis of the cost metric and its influence on the texture quality is presented, which is followed by a modification to the cost metric to reduce computational cost and to make it more suitable for screen design.
- 23 January 2011
- Published by SPIE-Intl Soc Optical Eng
- Vol. 7866
Cost function analysis for stochastic clustered-dot halftoning based on direct binary search
Most electrophotographic printers use periodic, clustered-dot screening for rendering smooth and stable prints. However, periodic, clustered-dot screening suffers from the problem of periodic moir´e resulting from interference between the component periodic screens superposed for color printing. There has been proposed an approach, called CLU-DBS for stochastic, clustered-dot halftoning and screen design based on direct binary search. This method deviates from conventional DBS in its use of different filters in different phases of the algorithm. In this paper, we derive a closed-form expression for the cost metric which is minimized in CLU-DBS. The closed-form expression provides us with a clearer insight on the relationship between input parameters and processes, and the output texture, thus enabling us generate better quality texture. One of the limitations of the CLU-DBS algorithm proposed earlier is the inversion in the distribution of clusters and voids in the final halftone with respect to the initial halftone. In this paper, we also present a technique for avoiding the inversion by negating the sign of one of the error terms in the newly derived cost metric, which is responsible for clustering. This not only simplifies the CLU-DBS screen design process, but also significantly reduces the number of iterations required for optimization.
- 23 January 2011
- Published by SPIE-Intl Soc Optical Eng
- Vol. 7866
Cost function analysis for stochastic clustered-dot halftoning based on direct binary search
Most electrophotographic printers use periodic, clustered-dot screening for rendering smooth and stable prints. However, periodic, clustered-dot screening suffers from the problem of periodic moir´e resulting from interference between the component periodic screens superposed for color printing. There has been proposed an approach, called CLU-DBS for stochastic, clustered-dot halftoning and screen design based on direct binary search. This method deviates from conventional DBS in its use of different filters in different phases of the algorithm. In this paper, we derive a closed-form expression for the cost metric which is minimized in CLU-DBS. The closed-form expression provides us with a clearer insight on the relationship between input parameters and processes, and the output texture, thus enabling us generate better quality texture. One of the limitations of the CLU-DBS algorithm proposed earlier is the inversion in the distribution of clusters and voids in the final halftone with respect to the initial halftone. In this paper, we also present a technique for avoiding the inversion by negating the sign of one of the error terms in the newly derived cost metric, which is responsible for clustering. This not only simplifies the CLU-DBS screen design process, but also significantly reduces the number of iterations required for optimization.