Look up table (LUT) method for image halftoning

Look up table (LUT) method for image halftoning. Mege, M. & Vaidyanathan, P. In Image Processing, 2000. Proceedings. 2000 International Conference on, volume 3, pages 993 -996 vol.3, 2000.
doi abstract bibtex

We have previously applied the look up table (LUT) method for inverse halftoning. We also proposed a tree-structure LUT inverse halftoning in order to reduce the memory requirements of the LUT method. We introduce the LUT based halftoning method. Pixels from a causal neighborhood and the contone value of the current pixel are included in the LUT. The LUT halftoning requires no arithmetic operations other than memory access. For any halftoning method, a sample set of images and halftones of these images is used. We introduce the tree-structure LUT (TLUT) halftoning. Even though this method is more complex than LUT halftoning it produces better halftones and it requires much less storage than LUT halftoning. We demonstrate how the error diffusion characteristics can be achieved with this method. The algorithm is trained on halftones obtained by direct binary search (DBS) images. The complexity of the tree-structure LUT halftoning is higher than the error diffusion algorithm but much lower than the DBS algorithm. Also, the halftone quality of TLUT halftoning increases if the size of TLUT gets larger. Thus, the halftone image quality between the error diffusion and DBS is achieved depending on the size of the tree-structure in the TLUT algorithm

@inproceedings{899625,
	Author = {Mege, M. and Vaidyanathan, P.P.},
	Booktitle = {Image Processing, 2000. Proceedings. 2000 International Conference on},
	Date-Added = {2012-08-20 14:08:34 +0000},
	Date-Modified = {2012-08-20 14:08:34 +0000},
	Doi = {10.1109/ICIP.2000.899625},
	Keywords = {complexity;direct binary search images;error diffusion characteristics;halftone image quality;image halftoning;look up table method;memory access;memory requirements reduction;tree-structure LUT halftoning;tree-structure LUT inverse halftoning;tree-structure size;image processing;search problems;table lookup;trees (mathematics);},
	Pages = {993 -996 vol.3},
	Title = {Look up table (LUT) method for image halftoning},
	Volume = {3},
	Year = {2000},
	Abstract = {We have previously applied the look up table (LUT) method for inverse halftoning. We also proposed a tree-structure LUT inverse halftoning in order to reduce the memory requirements of the LUT method. We introduce the LUT based halftoning method. Pixels from a causal neighborhood and the contone value of the current pixel are included in the LUT. The LUT halftoning requires no arithmetic operations other than memory access. For any halftoning method, a sample set of images and halftones of these images is used. We introduce the tree-structure LUT (TLUT) halftoning. Even though this method is more complex than LUT halftoning it produces better halftones and it requires much less storage than LUT halftoning. We demonstrate how the error diffusion characteristics can be achieved with this method. The algorithm is trained on halftones obtained by direct binary search (DBS) images. The complexity of the tree-structure LUT halftoning is higher than the error diffusion algorithm but much lower than the DBS algorithm. Also, the halftone quality of TLUT halftoning increases if the size of TLUT gets larger. Thus, the halftone image quality between the error diffusion and DBS is achieved depending on the size of the tree-structure in the TLUT algorithm},
	Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAbYAAAAAAbYAAgAACEFyY2hpdmlvAAAAAAAAAAAAAAAAAAAAAAAAAMyPzdRIKwAAAADY/wwwMDg5OTYyNS5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANlDzFgRegAAAAAAAAAAAAEAAwAACQAAAAAAAAAAAAAAAAAAAAAGUGFwZXJzABAACAAAzI+xtAAAABEACAAAzFf1WgAAAAEAEAAA2P8AANj9AADY+gAAAFYAAgBPQXJjaGl2aW86RG9jdW1lbnRhemlvbmk6AEFydGljb2xpIHNjaWVudGlmaWNpOgBDYXRhbG9nYXRpOgBQYXBlcnM6ADAwODk5NjI1LnBkZgAADgAaAAwAMAAwADgAOQA5ADYAMgA1AC4AcABkAGYADwASAAgAQQByAGMAaABpAHYAaQBvABIAQy9Eb2N1bWVudGF6aW9uaS9BcnRpY29saSBzY2llbnRpZmljaS9DYXRhbG9nYXRpL1BhcGVycy8wMDg5OTYyNS5wZGYAABMAES9Wb2x1bWVzL0FyY2hpdmlvAP//AACABdIcHR4fWCRjbGFzc2VzWiRjbGFzc25hbWWjHyAhXU5TTXV0YWJsZURhdGFWTlNEYXRhWE5TT2JqZWN0XxATUGFwZXJzLzAwODk5NjI1LnBkZtIcHSQloiUhXE5TRGljdGlvbmFyeRIAAYagXxAPTlNLZXllZEFyY2hpdmVyAAgAEQAWAB8AKAAyADUAOgA8AEUASwBSAF0AZQBsAG8AcQBzAHYAeAB6AHwAhgCTAJgAoAJaAlwCYQJqAnUCeQKHAo4ClwKtArICtQLCAscAAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAAC2Q==},
	Bdsk-Url-1 = {http://dx.doi.org/10.1109/ICIP.2000.899625}}

Downloads: 0

{"_id":"JFizPNkDte5Nscyha","bibbaseid":"mege-vaidyanathan-lookuptablelutmethodforimagehalftoning-2000","downloads":0,"creationDate":"2017-07-17T05:17:29.216Z","title":"Look up table (LUT) method for image halftoning","author_short":["Mege, M.","Vaidyanathan, P."],"year":2000,"bibtype":"inproceedings","biburl":"http://colanicchia.net/papers.bib","bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"propositions":[],"lastnames":["Mege"],"firstnames":["M."],"suffixes":[]},{"propositions":[],"lastnames":["Vaidyanathan"],"firstnames":["P.P."],"suffixes":[]}],"booktitle":"Image Processing, 2000. Proceedings. 2000 International Conference on","date-added":"2012-08-20 14:08:34 +0000","date-modified":"2012-08-20 14:08:34 +0000","doi":"10.1109/ICIP.2000.899625","keywords":"complexity;direct binary search images;error diffusion characteristics;halftone image quality;image halftoning;look up table method;memory access;memory requirements reduction;tree-structure LUT halftoning;tree-structure LUT inverse halftoning;tree-structure size;image processing;search problems;table lookup;trees (mathematics);","pages":"993 -996 vol.3","title":"Look up table (LUT) method for image halftoning","volume":"3","year":"2000","abstract":"We have previously applied the look up table (LUT) method for inverse halftoning. We also proposed a tree-structure LUT inverse halftoning in order to reduce the memory requirements of the LUT method. We introduce the LUT based halftoning method. Pixels from a causal neighborhood and the contone value of the current pixel are included in the LUT. The LUT halftoning requires no arithmetic operations other than memory access. For any halftoning method, a sample set of images and halftones of these images is used. We introduce the tree-structure LUT (TLUT) halftoning. Even though this method is more complex than LUT halftoning it produces better halftones and it requires much less storage than LUT halftoning. We demonstrate how the error diffusion characteristics can be achieved with this method. The algorithm is trained on halftones obtained by direct binary search (DBS) images. The complexity of the tree-structure LUT halftoning is higher than the error diffusion algorithm but much lower than the DBS algorithm. Also, the halftone quality of TLUT halftoning increases if the size of TLUT gets larger. Thus, the halftone image quality between the error diffusion and DBS is achieved depending on the size of the tree-structure in the TLUT algorithm","bdsk-file-1":"YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAbYAAAAAAbYAAgAACEFyY2hpdmlvAAAAAAAAAAAAAAAAAAAAAAAAAMyPzdRIKwAAAADY/wwwMDg5OTYyNS5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANlDzFgRegAAAAAAAAAAAAEAAwAACQAAAAAAAAAAAAAAAAAAAAAGUGFwZXJzABAACAAAzI+xtAAAABEACAAAzFf1WgAAAAEAEAAA2P8AANj9AADY+gAAAFYAAgBPQXJjaGl2aW86RG9jdW1lbnRhemlvbmk6AEFydGljb2xpIHNjaWVudGlmaWNpOgBDYXRhbG9nYXRpOgBQYXBlcnM6ADAwODk5NjI1LnBkZgAADgAaAAwAMAAwADgAOQA5ADYAMgA1AC4AcABkAGYADwASAAgAQQByAGMAaABpAHYAaQBvABIAQy9Eb2N1bWVudGF6aW9uaS9BcnRpY29saSBzY2llbnRpZmljaS9DYXRhbG9nYXRpL1BhcGVycy8wMDg5OTYyNS5wZGYAABMAES9Wb2x1bWVzL0FyY2hpdmlvAP//AACABdIcHR4fWCRjbGFzc2VzWiRjbGFzc25hbWWjHyAhXU5TTXV0YWJsZURhdGFWTlNEYXRhWE5TT2JqZWN0XxATUGFwZXJzLzAwODk5NjI1LnBkZtIcHSQloiUhXE5TRGljdGlvbmFyeRIAAYagXxAPTlNLZXllZEFyY2hpdmVyAAgAEQAWAB8AKAAyADUAOgA8AEUASwBSAF0AZQBsAG8AcQBzAHYAeAB6AHwAhgCTAJgAoAJaAlwCYQJqAnUCeQKHAo4ClwKtArICtQLCAscAAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAAC2Q==","bdsk-url-1":"http://dx.doi.org/10.1109/ICIP.2000.899625","bibtex":"@inproceedings{899625,\n\tAuthor = {Mege, M. and Vaidyanathan, P.P.},\n\tBooktitle = {Image Processing, 2000. Proceedings. 2000 International Conference on},\n\tDate-Added = {2012-08-20 14:08:34 +0000},\n\tDate-Modified = {2012-08-20 14:08:34 +0000},\n\tDoi = {10.1109/ICIP.2000.899625},\n\tKeywords = {complexity;direct binary search images;error diffusion characteristics;halftone image quality;image halftoning;look up table method;memory access;memory requirements reduction;tree-structure LUT halftoning;tree-structure LUT inverse halftoning;tree-structure size;image processing;search problems;table lookup;trees (mathematics);},\n\tPages = {993 -996 vol.3},\n\tTitle = {Look up table (LUT) method for image halftoning},\n\tVolume = {3},\n\tYear = {2000},\n\tAbstract = {We have previously applied the look up table (LUT) method for inverse halftoning. We also proposed a tree-structure LUT inverse halftoning in order to reduce the memory requirements of the LUT method. We introduce the LUT based halftoning method. Pixels from a causal neighborhood and the contone value of the current pixel are included in the LUT. The LUT halftoning requires no arithmetic operations other than memory access. For any halftoning method, a sample set of images and halftones of these images is used. We introduce the tree-structure LUT (TLUT) halftoning. Even though this method is more complex than LUT halftoning it produces better halftones and it requires much less storage than LUT halftoning. We demonstrate how the error diffusion characteristics can be achieved with this method. The algorithm is trained on halftones obtained by direct binary search (DBS) images. The complexity of the tree-structure LUT halftoning is higher than the error diffusion algorithm but much lower than the DBS algorithm. Also, the halftone quality of TLUT halftoning increases if the size of TLUT gets larger. Thus, the halftone image quality between the error diffusion and DBS is achieved depending on the size of the tree-structure in the TLUT algorithm},\n\tBdsk-File-1 = {YnBsaXN0MDDUAQIDBAUIJidUJHRvcFgkb2JqZWN0c1gkdmVyc2lvblkkYXJjaGl2ZXLRBgdUcm9vdIABqAkKFRYXGyIjVSRudWxs0wsMDQ4RFFpOUy5vYmplY3RzV05TLmtleXNWJGNsYXNzog8QgASABqISE4ACgAOAB1lhbGlhc0RhdGFccmVsYXRpdmVQYXRo0hgNGRpXTlMuZGF0YU8RAbYAAAAAAbYAAgAACEFyY2hpdmlvAAAAAAAAAAAAAAAAAAAAAAAAAMyPzdRIKwAAAADY/wwwMDg5OTYyNS5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAANlDzFgRegAAAAAAAAAAAAEAAwAACQAAAAAAAAAAAAAAAAAAAAAGUGFwZXJzABAACAAAzI+xtAAAABEACAAAzFf1WgAAAAEAEAAA2P8AANj9AADY+gAAAFYAAgBPQXJjaGl2aW86RG9jdW1lbnRhemlvbmk6AEFydGljb2xpIHNjaWVudGlmaWNpOgBDYXRhbG9nYXRpOgBQYXBlcnM6ADAwODk5NjI1LnBkZgAADgAaAAwAMAAwADgAOQA5ADYAMgA1AC4AcABkAGYADwASAAgAQQByAGMAaABpAHYAaQBvABIAQy9Eb2N1bWVudGF6aW9uaS9BcnRpY29saSBzY2llbnRpZmljaS9DYXRhbG9nYXRpL1BhcGVycy8wMDg5OTYyNS5wZGYAABMAES9Wb2x1bWVzL0FyY2hpdmlvAP//AACABdIcHR4fWCRjbGFzc2VzWiRjbGFzc25hbWWjHyAhXU5TTXV0YWJsZURhdGFWTlNEYXRhWE5TT2JqZWN0XxATUGFwZXJzLzAwODk5NjI1LnBkZtIcHSQloiUhXE5TRGljdGlvbmFyeRIAAYagXxAPTlNLZXllZEFyY2hpdmVyAAgAEQAWAB8AKAAyADUAOgA8AEUASwBSAF0AZQBsAG8AcQBzAHYAeAB6AHwAhgCTAJgAoAJaAlwCYQJqAnUCeQKHAo4ClwKtArICtQLCAscAAAAAAAACAQAAAAAAAAAoAAAAAAAAAAAAAAAAAAAC2Q==},\n\tBdsk-Url-1 = {http://dx.doi.org/10.1109/ICIP.2000.899625}}\n\n","author_short":["Mege, M.","Vaidyanathan, P."],"key":"899625","id":"899625","bibbaseid":"mege-vaidyanathan-lookuptablelutmethodforimagehalftoning-2000","role":"author","urls":{},"keyword":["complexity;direct binary search images;error diffusion characteristics;halftone image quality;image halftoning;look up table method;memory access;memory requirements reduction;tree-structure LUT halftoning;tree-structure LUT inverse halftoning;tree-structure size;image processing;search problems;table lookup;trees (mathematics);"],"downloads":0},"search_terms":["look","table","lut","method","image","halftoning","mege","vaidyanathan"],"keywords":["complexity","direct binary search images","error diffusion characteristics","halftone image quality","image halftoning","image processing","look up table method","memory access","memory requirements reduction","search problems","table lookup","tree-structure lut halftoning","tree-structure lut inverse halftoning","tree-structure size","trees (mathematics)","complexity;direct binary search images;error diffusion characteristics;halftone image quality;image halftoning;look up table method;memory access;memory requirements reduction;tree-structure lut halftoning;tree-structure lut inverse halftoning;tree-structure size;image processing;search problems;table lookup;trees (mathematics);"],"authorIDs":[],"dataSources":["eyzJRcaLBwRJG9zBw"]}