• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.2
• /
• pp.457-476
• /
• 2011

This paper presents an improved XOR-based Data Hiding Scheme (XDHS) to hide a halftone image in more than two halftone stego images. The hamming weight and hamming distance is a very important parameter affecting the quality of a halftone image. For this reason, we proposed a method that involves minimizing the hamming weights and hamming distances between the stego image and cover image in $2{\times}2$-pixel grids. Moreover, our XDHS adopts a block-wise operation to improve the quality of a halftone image and stego images. Furthermore, our scheme improves security by using a block-wise operation with A-patterns and B-patterns. Our XDHS method achieves a high quality with good security compared to the prior arts. An experiment verified the superiority of our XDHS compared with previous methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.4
• /
• pp.656-664
• /
• 2006

In this paper, we introduce a new LUT based watermarking method for a halftone image. Watermark bits are hidden at pseudo-random locations of halftone image in the proposed method. The pixel values of the halftone image are determined from the LUT entry indexed by both the neighborhood halftone pixels and current grayscale value. The LUT is trained by a set of grayscale images and corresponding halftone images. Advantage of the LUT method is that it can be executed very fast compared with other watermarking methods for a halftone image. Therefore, the algorithm can be embedded in a printer. Experiments for real scanned images showed that the method is a feasible method to hide the large amount of data within a halftone image without noticeable distortion and comparing to the DHED method, is almost same in quality but significantly shorten in processing time.

• Journal of Korea Multimedia Society
• /
• v.7 no.3
• /
• pp.327-339
• /
• 2004

In this paper, we propose a new watermark algorithm for halftone images using iterative error minimizing method. In the proposed method, watermark bits are hidden at pseudo-random locations within a halftone image. To remove the distortions due to the inserted watermark bits and increase the invisibility of watermark, an iterative error minimizing technique is used. We define the halftoning error is defined as the difference between the original grayscale image and HVS-filtered printed halftone image. Then we iteratively find the pixel pattern with minimum halftoning error and displace the original pixel pattern with it. In order to be robust to geometrical modification like cropping or rotation, we insert the same watermark periodically into halftone images. Experiments using printed and scanned images show that the proposed method is a robust method to the geometrical modification and to hide the large amount of data within a halftone image without noticeable distortion.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.3
• /
• pp.37-43
• /
• 2009

In this paper, we proposed that a novel method base on a binary image that technique is proposed for data hiding into binary images and halftone image. A binary image is bitmap image and halftone is composed by two-tone value in a limited region in an image. For this reason, it is not easy to hide messages in binary images. PWLC is a new method to hide a message in binary images. However, it yields images of unacceptable quality, unless you should change very few of it. Therefore, in order to solve this problem, we used run-length method into binary images. That is, we find a proper region to hide messages. In this paper, we proposed new method to hide messages in binary images. In addition, we proved that our algorithm is better than PWLC through the experiment.

• Journal of Korea Multimedia Society
• /
• v.4 no.2
• /
• pp.116-129
• /
• 2001

To improve the performance of the inverse halftoning, smoothing masks should be designed optimally by using the accurate information of halftone cells. In this thesis, the method of energy minimization is so defined as to determine the exact information of halftone cell. A heuristic search method is proposed to obtain efficiently the parameters of halftone cells which determine the minimum energy. A halftone-peak modeling method with several functions is proposed and used to get initial values of the parameters. The dimension decomposition technique is also adopted to speed up the search process of energy minimization. Several experiments show that the proposed method extracts correct location of the seed pixel of the halftone cell and the extracted information of the halftone cell can be used to get more exactly smoothed color images. The proposed method can be applied to extract the texture patterns, to separate channel images of a scanned color halftone image, and to extract the moire area in an image.

• Journal of Broadcast Engineering
• /
• v.17 no.2
• /
• pp.316-324
• /
• 2012

In this paper, a novel descreening method using HOG(histogram of gradient)-based adaptive smoothing filter is proposed. Conventional edge-oriented smoothing methods does not provide enough smoothing to the halftone image due to the edge-like characteristic of the halftone noise. Moreover, clustered-dot halftoning method, which is commonly used in printing tends to create Moire pattern because of the intereference in color channels. Therefore, the proposed method uses HOG to distinguish edges and the amount of smoothing to be performed on the halftone image is then calculated according to the magnitude of the HOG in the edge and edge normal orientation. The proposed method was tested on various scanned halftone materials, and the results show that it effectively removes halftone noises as well as Moire pattern while preserving image details.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.6
• /
• pp.96-104
• /
• 2011

A halftoning method is used to obtain a binary image visually similar to a continuous gray-level image through the image output devices employing the limited number of gray-levels. As a halftoning method, the error diffusion method is widely used in various applications because of its low computational complexity and good image quality. However, this method weakens the edge in the process of error diffusion to the neighboring pixels. In this case, degradation of the edge quality and damage of the vivid image is expected. To solve these problems, the proposed method determines the adaptive error filter considering the error information of the present pixel and edge distribution of the neighbor pixels. Compared with the conventional methods for enhancing edges, the proposed method involves relatively a few process resources because of its simple procedure, still considerably improving the edges in the halftone image. To evaluate the objective image quality, the performance of the proposed method is compared with that of the conventional method in terms of the edge correlation and the local average accordance.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.465-467
• /
• 1992

This paper shows 3D vision system based on halftone image analysis. Any halftone image has its own surface vector normal to surface patch. To classily the given 3D images, all the patch on 3D object are transformed to black/white halftone. First we extract the general learning patterns which represents required slopes and their attributes. And next we propose 3D segmentation by searching intensity, slope and density. Artificial neural network is found to be very suitable in this approach, because it has powerful learning quality and noise tolerant. In this study, 3D shape reconstruct using pyramidian model. Our results are evaluated to enhance the quality.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.6A
• /
• pp.575-583
• /
• 2002

JBIG2 is an International Standard fur compression of Bi-level images and documents. JBIG2 supports three encoding modes for high compression according to region features of documents. One of which is generic region coding for bitmap coding. The basic bitmap coder is either MMR or arithmetic coding. Pattern matching coding method is used for text region, and halftone pattern coding is used for halftone region. In this paper, a document is segmented into line-art, halftone and text region for JBIG2 encoding and JBIG2 CODEC is implemented. For efficient region segmentation of documents, region segmentation method using wavelet coefficient is applied with existing boundary extraction technique. In case of facsimile test image(IEEE-167a), there is improvement in compression ratio of about 2% and enhancement of subjective quality. Also, we propose arbitrary shape halftone region coding, which improves subjective quality in talc neighboring text of halftone region.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.2
• /
• pp.405-424
• /
• 2013

In publishing applications, it is advantageous to embed data in halftone images. The CPT scheme (Chen-Pan-Tseng, 2000) is a steganographic data hiding scheme that was proposed for binary images, e.g., facsimiles. The CPT scheme uses a secret key and weight matrix to protect the hidden data and can hide as many as $r={\lfloor}{\log}_2(m{\times}n+1){\rfloor}$ bits of data in the image by changing at most 2 bits in the image. Our proposed scheme also uses a secret key to protect it from being compromised and a weight matrix to increase the data hiding rate. Our scheme improves the performance of the CPT scheme by using the simple principle of splitting each block into two parts. Our proposed scheme is called improved CPT (ICPT) and has a very high embedding capacity compared to previous schemes. Experimental results demonstrate that our proposed scheme generally has higher performance than previous schemes.