Improved inverse halftoning using vector and texture-lookup table-based learning approach

► We build up t a LUT which maps an input halftone pattern to a subimage based on texture classification. ► We propose a Gaussian-based estimation to obtain a gray image by synthesizing the mapped subimages. ► Experimental results demonstrate the quality advantage of the proposed method. Lookup tabl...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Expert systems with applications 2011-11, Vol.38 (12), p.15573-15581
Hauptverfasser: Huang, Yong-Huai, Chung, Kuo-Liang, Dai, Bi-Ru
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:► We build up t a LUT which maps an input halftone pattern to a subimage based on texture classification. ► We propose a Gaussian-based estimation to obtain a gray image by synthesizing the mapped subimages. ► Experimental results demonstrate the quality advantage of the proposed method. Lookup table-based inverse halftoning (LiH) is a popular approach to reconstruct the gray image from an input halftone image. In this paper, two improved LiH algorithms are presented. We first present a vector- and lookup table-based (VLUT-based) IH algorithm, called the VLIH algorithm, to improve the image quality of the previous LiH algorithm. Different from the previous LiH algorithm which only utilizes the gray value of each pixel to build up the LUT, our proposed VLIH algorithm considers both the gray value of each pixel and its eight neighboring pixels to build up the VLUT. Combining the proposed VLUT and the DCT-based learning scheme, an efficient texture-based VLUT (TVLUT) is built up and it constitutes the kernel of the second proposed IH algorithm called the TVLIH algorithm. Under thirty training images, with satisfactory execution-time requirement, experimental results demonstrate the quality advantage of our proposed VLIH and TVLIH algorithms when compared to the previously published three LiH algorithms.
ISSN:0957-4174
1873-6793
DOI:10.1016/j.eswa.2011.06.002