{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T23:10:16Z","timestamp":1693696216248},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2008,12]]},"abstract":"<jats:p> Screening is an important task to convert a continuous-tone image into a binary image with pure black and white pixels. The main contribution of this paper is to show a new algorithm for cluster-dot screening using a local exhaustive search. Our new algorithm generates 2-cluster, 3-cluster, and 4-cluster binary images, in which all dots have at least 2, 3, and 4 pixels, respectively. The key idea of our new screening method is to repeat a local exhaustive search that finds the best binary pattern in small windows of size k \u00d7 k in a binary image. The experimental results show that the local exhaustive search produces high quality and sharp cluster-dot binary images. We also present an hardware algorithm to accelerate the computation. Our hardware algorithm for a round of the local exhaustive search runs O(k<jats:sup>2<\/jats:sup>) clock cycles while the software implementation runs in O(2<jats:sup>k<jats:sup>2<\/jats:sup><\/jats:sup> w<jats:sup>2<\/jats:sup>) time, where (2w + 1) \u00d7 (2w + 1) is the size of Gaussian filter. Thus, from theoretical point of view, our hardware algorithm achieves a speedup factor of O(w<jats:sup>2<\/jats:sup>). To show that our hardware algorithm is practically fast, we have implemented it on an FPGA. Our hardware algorithm achieved a speedup factor of up to 229 over the software implementation. <\/jats:p>","DOI":"10.1142\/s0129054108006339","type":"journal-article","created":{"date-parts":[[2009,1,5]],"date-time":"2009-01-05T09:36:29Z","timestamp":1231148189000},"page":"1373-1386","source":"Crossref","is-referenced-by-count":10,"title":["A NEW FM SCREENING METHOD TO GENERATE CLUSTER-DOT BINARY IMAGES USING THE LOCAL EXHAUSTIVE SEARCH WITH FPGA ACCELERATION"],"prefix":"10.1142","volume":"19","author":[{"given":"YASUAKI","family":"ITO","sequence":"first","affiliation":[{"name":"Department of Information Engineering, Hiroshima University, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan"}]},{"given":"KOJI","family":"NAKANO","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, Hiroshima University, Kagamiyama, Higashi-Hiroshima, 739-8527, Japan"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf2","author":"Asano T.","journal-title":"IEICE Transactions on Information and Systems"},{"key":"rf3","first-page":"803","volume":"86","author":"Bordim J. L.","journal-title":"IEICE Transactions on Information and Systems, E"},{"key":"rf4","first-page":"403","author":"Bordim J. L.","journal-title":"International Journal on Foundations of Computer Science"},{"key":"rf8","volume-title":"Modern Digital Halftoning","author":"Lau D. L.","year":"2001"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1109\/71.877941"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321882"},{"key":"rf11","first-page":"811","volume":"86","author":"Nakano K.","journal-title":"IEICE Transactions on Information and Systems, E"},{"key":"rf12","first-page":"57","author":"Nakano K.","journal-title":"Theoretical Computer Science"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054108006339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:32:48Z","timestamp":1565137968000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054108006339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":8,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2008,12]]}},"alternative-id":["10.1142\/S0129054108006339"],"URL":"https:\/\/doi.org\/10.1142\/s0129054108006339","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12]]}}}