(k,n)-visual secret sharing scheme ((k,n)-VSSS) is a method to divide a secret image into n images called shares that enable us to restore the original image by only stacking at least k of them without any complicated computations. In this paper, we consider (2,2)-VSSS to share two secret images at the same time only by two shares, and investigate the methods to improve the quality of decoded images. More precisely, we consider (2,2)-VSSS in which the first secret image is decoded by stacking those two shares in the usual way, while the second one is done by stacking those two shares in the way that one of them is used reversibly. Since the shares must have some subpixels that inconsistently correspond to pixels of the secret images, the decoded pixels do not agree with the corresponding pixels of the secret images, which causes serious degradation of the quality of decoded images. To reduce such degradation, we propose several methods to construct shares that utilize 8-neighbor Laplacian filter and halftoning. Then we show that the proposed methods can effectively improve the quality of decoded images. Moreover, we demonstrate that the proposed methods can be naturally extended to (2,2)-VSSS for RGB images.

We present a new framework for embedding holographic halftone watermarking data into images by fusion of scale-related wavelet coefficients. The halftone watermarking image is obtained by using error-diffusion method and converted into Fresnel hologram, which is considered to be the initial password. After encryption, a scrambled watermarking image through Arnold transform is embedded into the host image during the halftoning process. We characterize the multi-scale representation of the original image using the discrete wavelet transform. The boundary information of the target image is fused by correlation of wavelet coefficients across wavelet transform layers to increase the pixel resolution scale. We apply the inter-scale fusion method to gain fusion coefficient of the fine-scale, which takes into account both the detail of the image and approximate information. Using the proposed method, the watermarking information can be embedded into the host image with recovery against the halftoning operation. The experimental results show that the proposed approach provides security and robustness against JPEG compression and different attacks compared to previous alternatives.

Image quality of halftone print is significantly influenced by optical characteristics of paper. Light scattering in paper produces optical dot gain, which has a significant influence on the tone and color reproductions of halftone print. The light scattering can be quantified by the Modulation Transfer Function (MTF) of paper. Several methods have been proposed to measure the MTF of paper. However, these methods have problems in efficiency or accuracy in the measurement. In this article, a new method is proposed to measure the MTF of paper efficiently and accurately, and the dot gain effect on halftone print is analyzed. The MTF is calculated from the ratio in spatial frequency domain between the responses of incident pencil light to paper and the perfect specular reflector. Since the spatial frequency characteristic of input pencil light can be obtained from the response of perfect specular reflector, it does not need to produce the input illuminant having "ideal" impulse characteristic. Our method is experimentally efficient since only two images need to be measured. Besides it can measure accurately since the data can be approximated by the conventional MTF model. Next, we predict the reflectance distribution of halftone print using the measured MTF in microscopy in order to analyze the dot gain effect since it can clearly be observed in halftone micro-structure. Finally, a simulation is carried out to remove the light scattering effect from the predicted image. Since the simulated image is not affected by the optical dot gain, it can be applied to analyze the real dot coverage.

This paper proposes a new color halftone image quality assessment method based upon the color structural similarity measure with considering the human visual characteristics. To include the color visual characteristics, we carry out the color filtering for each luminance, red-green, and blue-yellow channels. Then, we apply the color structural similarity measure to the color filtered images, which are the reference image and the halftoned image, to evaluate the localized structural difference. By considering those characteristics, in this paper, the assessment of the color halftone images can be realized. We apply the proposed measure to the various kinds of color halftone images and confirm that the proposed measure can give reasonable results compared with the results by subjective evaluation.

The reduction of a structural pattern at specific gray levels or at the special condition of image data has mainly been discussed in digital halftone methods. This problem is more severe in some flat panel displays because their black levels typically are brighter than other displays blocks. The authors proposed an advanced confined error diffusion (ACED) algorithm which was a well-organized halftone algorithm for flat panel devices. In this paper, we extend the ACED algorithm to the multi-level systems, which are capable of displaying more than 2 levels. Our extension has two merits for the hardware implementation. First, it can be processed in real time using the look-up table based method. The second one is the flexibility of selecting the used gray level. This paper discusses the performance of the proposed algorithms with experimental results for natural test images.

In this letter, we propose a new approach to incremental coding of the subfield codes for plasma display panels (PDPs). The proposed approach suppresses the halftone noise of the PDPs, while completely eliminating false contour noise, as do existing incremental subfield codes, by selecting an optimal incremental subfield code adaptively for a given input image. The proposed method maps the problem of selecting the optimal incremental subfield code onto a special-case shortest path problem. Results of experiment using 109 sample images illustrated that the proposed method improved the average peak signal-to-noise ratio by 4.4-6.2 dB in halftone noise compared with existing incremental subfield coding methods.

This letter proposes a visible watermarking scheme for halftone images. It exploits HVS filtering to transform the image in binary domain into continuous-tone domain for watermark embedding. Then a codeword search operation converts the watermarked continuous-tone image into binary domain. The scheme is flexible for two weighting factors are involved to adjust the watermark embedding strength and the average intensity of the watermarked image. Moreover, it can be used in some applications where original continuous-tone images are not available and the halftoning method is unknown.

This letter presents an improved visible watermarking scheme for halftone images. It incorporates watermark embedding into ordered dither halftoning by threshold modulation. The input images include a continuous-tone host image (e.g. an 8-bit gray level image) and a binary watermark image, and the output is a halftone image with a visible watermark. Our method is content adaptive because it takes local intensity information of the host image into account. Experimental results demonstrate effectiveness of the proposed technique. It can be used in practical applications for halftone images, such as commercial advertisement, content annotation, copyright announcement, etc.

This letter proposes an efficient method to find the optimum subfield code, which minimizes the visual artifacts on the motion pictures of the plasma display panel (PDP). Existing codes were constructed to reduce dynamic false contour (DFC) only, and they are fixed codes used for every image. In contrast, the proposed method aims to minimize the total artifacts by DFC and halftone noise (HN), and it finds the best code for a given image, dynamically. First, this letter presents the novel models to estimate the effect of DFC and HN for given codewords and a given image. Then, it presents an efficient method that finds the optimum code for a given image using the well-known shortest-path algorithm. Experimental results, using 459 HDTV images, illustrated that the proposed approach improved the average PSNR by 0.713 dB and 7.004 dB in DFC and HN, respectively, when compared with Gravity Centre Code [1].