检索结果-内蒙古大学图书馆

Conference on Color Imaging XVIII - Displaying, Processing, Hardcopy, and Applications

作者： Chandu, Kartheek Stanich, Mikel Wu, Chai Wah Trager, Barry Ricoh Prod Print Solut LLC 6300 Diagonal Highway Boulder CO 80301 USA IBM TJ Watson Res Ctr Yorktown Hts NY 10598 USA

ISBN: (纸本)9780819494252

In this paper, we describe adding constraints to the direct binary search (DBS) algorithm. An example of a useful constraint, illustrated in this paper, is having only one dot per column and row. DBS with such constraints requires greater than two toggles during each trial operation. Implementations of the DBS algorithm traditionally limit operations to either one toggle or swap during each trial. The example case in this paper produces a wrap-around pattern with uniformly distributed ON pixels which will have a pleasing appearance with precisely one ON pixel per each column and row. The algorithm starts with an initial continuous tone image and an initial pattern having only one ON pixel per column and row. The auto correlation function of Human Visual System (HVS) model is determined along with an initial perceived error. Multiple operation pixel error processing during each iteration is used to enforce the one ON pixel per column and row constraint. The constraint of a single ON pixel per column and row is used as an example in this paper. Further modification of the DBS algorithm for other constraints is possible, based on the details given in the paper. A mathematical framework to extend the algorithm to the more general case of direct Multi-bit search (DMS) is presented.

关键词： direct binary search DBS Halftone Inkjet printing flushing

来源：评论

学校读者我要写书评

暂无评论

Improved direct binary search-based algorithm for generating holograms for the application of holographic optical tweezers

引用

OPTICAL ENGINEERING 2012年第1期51卷

作者： Zhao, XuDong Li, Jing Tao, Tao Long, Qian Wu, Xiaoping Univ Sci & Technol China Coll Engn Sci Hefei 230027 Peoples R China

This paper presents an improved direct binary search (DBS)-based algorithm for generating holograms to holographic optical tweezers. The simulations show that the improved algorithm greatly enhances computation speed while maintaining high hologram efficiency and high-intensity homogeneous target spots. The improved algorithm was applied to generate holographic optical tweezers in several experiments. The experiments demonstrate that real-time trap and manipulation can be realized with the improved algorithm if the number of trapped microparticles is small. (C) 2012 Society of Photo-Optical Instrumentation Engineers (SPIE). [DOI: 10.1117/***.51.1.015801]

关键词： direct binary search computer-generated holograms spatial light modulator holographic optical tweezers

来源：评论

学校读者我要写书评

暂无评论

Noise shaping for direct binary search image halftoning

引用

JOURNAL OF ELECTRONIC IMAGING 2020年第3期29卷

作者： Chang, Li-Wen Liao, Jan-Ray Chaoyang Univ Technol Gen Educ Ctr Taichung Taiwan Natl Chung Hsing Univ Dept Elect Engn Taichung Taiwan

Among image halftoning algorithms, direct binary search (DBS) minimizes the total squared perceived error instead of using heuristic approaches. Therefore, it can generate halftone output with the best quality. The limitation of DBS is that its halftone pattern is controlled by the autocorrelation filter, which corresponds to both the human visual system and the printer model. Because of the low-pass characteristics of the filter, DBS can only generate blue-noise-like halftone pattern and the only variation is the clustered-dot algorithm proposed in 2013. We use the results of theoretical bounds to show that halftone patterns in DBS can be controlled in both frequency and spatial domains through an approach called "noise shaping." This approach is achieved through an added term to the filtered error in DBS. We also show that DBS clustered-dot halftoning is a special case of this noise-shaping approach. Experimental results show that both the spatial-domain and frequency-domain characteristics of the generated halftone pattern can be manipulated freely using this approach. (C) 2020 SPIE and IS&T

关键词： halftones direct binary search noise shaping clustered dot

来源：评论

学校读者我要写书评

暂无评论

Ink Drop Displacement Model-Based direct binary search

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2023年 32卷 3897-3911页

作者： Mao, Yafei Sarkar, Utpal Borrell, Isabel Abello, Lluis Allebach, Jan P. Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA Amazon Sunnyvale CA 94089 USA HP Inc Sant Cugat Del Valles 08174 Barcelona Spain Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

A novel statistical ink drop displacement (IDD) printer model for the direct binary search (DBS) halftoning algorithm is proposed. It is intended primarily for pagewide inkjet printers that exhibit dot displacement errors. The tabular approach in the literature predicts the gray value of a printed pixel based on the halftone pattern in some neighborhood of that pixel. However, memory retrieval time and the complexity of memory requirements hamper its feasibility in printers that have a very large number of nozzles and produce ink drops that affect a large neighborhood. To avoid this problem, our IDD model embodies dot displacements by moving each perceived ink drop in the image from its nominal location to its actual location, rather than manipulating the average gray values. This enables DBS to directly compute the appearance of the final printout without retrieving values from a table. In so doing, the memory issue is eliminated and the computation efficiency is enhanced. The deterministic cost function of DBS is replaced by the expectation over the ensemble of the displacements for the proposed model such that the statistical behavior of the ink drops is accounted for. Experimental results show significant improvement in the quality of the printed image over the original DBS. Besides, the image quality obtained by the proposed approach appears to be slightly better than that obtained by the tabular approach.

关键词： Printers Computational modeling Ink Printing Satellite broadcasting Analytical models Image quality Halftoning direct binary search Index Terms inkjet model-based

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Colorant-Based direct binary search Halftoning

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2010年第7期19卷 1824-1836页

作者： He, Zhen Xerox Corp Global Prod Delivery Grp Wilsonville OR 97070 USA

Colorant-based direct binary search (CB-DBS) halftoning proposed in [27] provides an image quality benchmark for dispersed-dot halftoning algorithms. The objective of this paper is to further push the image quality limit. An algorithm called hierarchical colorant-based direct binary search (HCB-DBS) is developed in this paper. By appropriately integrating yellow colorant into dot-overlapping and dot-positioning controls, it is demonstrated that HCB-DBS can achieve better halftone texture of both individual and joint dot-color planes, without compromising the dot distribution of more visible halftone of cyan and magenta colorants. The input color specification is first converted from colorant space to dot-color space with minimum brightness variation principle for full dot-overlapping control. The dot-colors are then split into groups based upon dot visibility. Hierarchical monochrome DBS halftoning is applied to make dot-positioning decision for each group, constrained on the already generated halftone of the groups with higher priority. And dot-coloring is decided recursively with joint monochrome DBS halftoning constrained on the related total dot distribution. Experiments show HCB-DBS improves halftone texture for both individual and joint dot-color planes. And it reduces the halftone graininess and free of color mottle artifacts, comparing to CB-DBS.

关键词： Color reproduction digital printing direct binary search display halftoning

来源：评论

学校读者我要写书评

暂无评论

Theoretical Bounds of direct binary search Halftoning

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2015年第11期24卷 3478-3487页

作者： Liao, Jan-Ray Natl Chung Hsing Univ Inst Commun Engn Dept Elect Engn Taichung 402 Taiwan

direct binary search (DBS) produces the images of the best quality among half-toning algorithms. The reason is that it minimizes the total squared perceived error instead of using heuristic approaches. The search for the optimal solution involves two operations: 1) toggle and 2) swap. Both operations try to find the binary states for each pixel to minimize the total squared perceived error. This error energy minimization leads to a conjecture that the absolute value of the filtered error after DBS converges is bounded by half of the peak value of the autocorrelation filter. However, a proof of the bound's existence has not yet been found. In this paper, we present a proof that shows the bound existed as conjectured under the condition that at least one swap occurs after toggle converges. The theoretical analysis also indicates that a swap with a pixel further away from the center of the autocorrelation filter results in a tighter bound. Therefore, we propose a new DBS algorithm which considers toggle and swap separately, and the swap operations are considered in the order from the edge to the center of the filter. Experimental results show that the new algorithm is more efficient than the previous algorithm and can produce half-toned images of the same quality as the previous algorithm.

关键词： Halftoning direct binary search theoretical bounds

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning Approach to Design of Aperiodic, Clustered-Dot Halftone Screens via direct binary search

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2022年 31卷 5498-5512页

作者： Frank, Tal Liu, Jiayin Gat, Shani Haik, Oren Mor, Orel Bat Roth, Itamar Allebach, Jan P. Yitzhaky, Yitzhak Hewlett Packard Indigo Ltd IL-76101 Ness Ziona Israel Ben Gurion Univ Negev Dept Electroopt Engn IL-84105 Beer Sheva Israel Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

Aperiodic, clustered-dot, halftone patterns have recently become popular for commercial printing of continuous-tone images with laser, electrophotographic presses, because of their inherent stability and resistance to moire artifacts. Halftone screens designed using the multistage, multipass, clustered direct binary search (MS-MP-CLU-DBS) algorithm can yield halftone patterns with very high visual quality. But the characteristics of these halftone patterns depend on three input parameters for which there are no known formulas to choose their values to yield halftone patterns of a certain quality level and scale. Using machine learning methods, two predictors are developed that take as input these three parameters. One predicts the quality level of the halftone pattern. The other one predicts the scale of the halftone pattern. To provide ground truth information for training these predictors, human subjects viewed a large number of halftone patches generated from MS-MP-CLU-DBS-designed screens and assigned each patch to one of four quality levels. For each patch, the location of the peak in the radially averaged power spectrum (RAPS) is calculated as a measure of the scale or effective line frequency of the pattern. Experimental results demonstrate the accuracy of the two predictors and the effectiveness of screen design procedures based on these predictors to generate both monochrome and color high quality halftone images.

关键词： Printing Satellite broadcasting Image color analysis Printers Presses Measurement Laser stability Halftone screen aperiodic clustered-dot halftone texture direct binary search radially averaged power spectrum print quality machine learning color halftoning

来源：评论

学校读者我要写书评

暂无评论

Clustered-Dot Halftoning With direct binary search

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 2013年第2期22卷 473-487页

作者： Goyal, Puneet Gupta, Madhur Staelin, Carl Fischer, Mani Shacham, Omri Allebach, Jan P. Graph Era Univ Dehra Dun 248002 India AT&T Serv Inc San Ramon CA 94583 USA Google Adv Technol Ctr IL-31905 Technion Israel Hewlett Packard Labs Israel IL-32000 Technion Israel HP Indigo Ltd IL-61999 Ness Ziona Israel Purdue Univ W Lafayette IN 47907 USA

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.

关键词： Clustered-dot digital halftoning direct binary search

来源：评论

学校读者我要写书评

暂无评论

Improved Block Truncation Coding Using Extreme Mean Value Scaling and Block-Based High Speed direct binary search

引用

IEEE SIGNAL PROCESSING LETTERS 2011年第11期18卷 694-697页

作者： Guo, Jing-Ming Su, Chang-Cheng Natl Taiwan Univ Sci & Technol Dept Elect Engn Taipei Taiwan

Block truncation coding (BTC) has been considered as an efficient compression technique for decades. However, the annoying blocking effect and false contour caused by low bit rate configuration are key problems. To solve these problems, many former halftoning-based BTCs are proposed. However, these schemes also induce another impulse noise issue while the previous issues still have room for improvement. To cope with this, the iteration-based halftoning is combined with BTC, namely direct-binary-search BTC (DBSBTC) to solve the aforementioned problems. Moreover, the high-speed DBS halftoning method along with the block-based strategy yield even faster processing speed than some of the former halftoning-based BTC schemes. As documented in the experimental results, the proposed DBSBTC is superior to the former halftoning-base BTC schemes in terms of image quality, and which makes the former schemes as potential candidates for surveillance and computer vision applications.

关键词： Block truncation coding digital halftoning direct binary search error diffusion image compression dot diffusion ordered dithering

来源：评论

学校读者我要写书评

暂无评论

Non-iterative direct binary search algorithm for fast generation of binary holograms

引用

OPTICS AND LASERS IN ENGINEERING 2019年 122卷 312-318页

作者： Kang, Ji-Hoon Leportier, Thibault Kim, Myungha Park, Min-Chul Korea Inst Sci & Technol Postsilicon Semicond Inst Ctr Optoelect Mat & Devices Seoul 02792 South Korea Seokyeong Univ Dept Comp Sci Seoul 02173 South Korea Korea Univ Sci & Technol KIST Sch Div Nano & Informat Technol Seoul 02792 South Korea

The direct binary search (DBS) algorithm is an efficient method for the generation of binary holograms, but it is also an iterative method involving lengthy computation. Thus, fast non-iterative approaches are more preferred in practice even though they yield poorer results. In this paper, we propose a strategy to drastically reduce the computational time of the DBS algorithm. First, we show that convergence of the conventional DBS algorithm can be significantly improved by optimizing the order in which the pixels are examined. Then, we demonstrate the efficiency of a design based on optimization of multiple small blocks of binary pixels through parallel computation. Since each block can be optimized in parallel utilizing platforms such as those offering cloud computing services, the time to compute the final pattern is determined by the computational time for a single block. The proposed block-partition strategy involves a trade-off between the computation time and the quality of the final hologram. However, it should be noted that simply randomizing the pixel examination order during the DBS procedure reduces the computational time by 67% even without parallel computation. In summary, our proposed method facilitates easier generation of high-quality binary holograms in less time than is required by the conventional DBS.

关键词： Holography binary hologram direct binary search

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：