• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.180-186
• /
• 2013

The primary goal of attack on steganographic images, termed steganalysis, is to detect the presence of hidden data by finding statistical abnormality of a stego-media caused by data embedding. This paper proposes a novel steganographic scheme based on improving the (7, 4) Hamming code for digital images. The proposed scheme embeds a segment of six secret bits into a group of nine cover pixels at a time. The experimental results show that the proposed scheme achieves a 0.67bpp embedding payload and a slightly higher visual quality of stego images compared with the previous arts.

• Journal of the Institute of Convergence Signal Processing
• /
• v.15 no.1
• /
• pp.1-8
• /
• 2014

Digital watermarking techniques are attracting attention as a proper solution to protect copyright for multimedia data. This paper proposes a new audio watermarking method based on Discrete Cosine Transformation (DCT) and Discrete Wavelet Transformation (DWT) for copyright protection. In our proposed watermarking method, the original audio is transformed into DCT domain and divided into two parts. Synchronization code is applied on the signal in first part and 2 levels DWT domain is applied on the signal in second part. The absolute value of DWT coefficient is divided into arbitrary number of segments and calculates the energy of each segment and middle peak. Watermarks are then embedded into each middle peak. Watermarks are extracted by performing the inverse operation of watermark embedding process. Experimental results show that the hidden watermark data is robust to re-sampling, low-pass filtering, re-quantization, MP3 compression, cropping, echo addition, delay, and pitch shifting, amplitude change. Performance analysis of the proposed scheme shows low error probability rates.

• Korean Journal of Optics and Photonics
• /
• v.19 no.4
• /
• pp.262-269
• /
• 2008

In this paper, we propose an image watermark method using multiple decoding keys. The advantages of this method are that the multiple original images are reconstructed by using multiple decoding keys in the same watermark image, and that the quality of reconstructed images is clearly enhanced based on the idea of Walsh code without any side lobe components in the decoding process. The zero-padded original images, multiplied with random-phase pattern to each other, are Fourier transformed. Encoded images are then obtained by taking the real-valued data from these Fourier transformed images. The embedding images are obtained by the product of independent Walsh codes, and these spreaded phase-encoded images which are multiplied with new random-phase images. Also we obtain the decoding keys by multiplying these random-phase images with the same Walsh code images used in the embedding images. A watermark image is then made from the linear superposition of the weighted embedding images and a cover image, which is multiplied with a new independent Walsh code. The original image is simply reconstructed by the inverse-Fourier transform of the despreaded image of the multiplication between the watermark image and the decoding key. Computer simulations demonstrate the efficiency of the proposed watermark method with multiple decoding keys and a good robustness to the external attacks such as cropping and compression.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.144-146
• /
• 2006

The Data Matrix of two-dimensional bar codes is a new technology capable of holding relatively large amounts of data compared to the conventional one-dimensional bar code which is just a key that can access detailed information to the host computer database. A secret key is used to prevent a watermark from malicious attacks. We encoded copyright information into a Data Matrix bar code for encoding process and it was spread a pseudo random pattern using owner key. We embedded a randomized watermark into the image using watermark's embedding position, pattern generated with a secret key. The experimental results have shown that the proposed scheme has good quality and is very robust to various attacks, such as JPEG compression and noise. Also the performance of the proposed scheme is verified by comparing the copyright information with the information which is extracted from a bar code scantier.

• Journal of Information Processing Systems
• /
• v.15 no.2
• /
• pp.271-287
• /
• 2019

The synchronization scheme based on moving average is robust and suitable for the same rule to be adopted in embedding watermark and synchronization code, but the imperceptibility and search efficiency is seldom reported. The study aims to improve the original scheme for robust audio watermarking. Firstly, the survival of the algorithm from desynchronization attacks is improved. Secondly, the scheme is improved in inaudibility. Objective difference grade (ODG) of the marked audio is significantly changed. Thirdly, the imperceptibility of the scheme is analyzed and the derived result is close to experimental result. Fourthly, the selection of parameters is optimized based on experimental data. Fifthly, the search efficiency of the scheme is compared with those of other synchronization code schemes. The experimental results show that the proposed watermarking scheme allows the high audio quality and is robust to common attacks such as additive white Gaussian noise, requantization, resampling, low-pass filtering, random cropping, MP3 compression, jitter attack, and time scale modification. Moreover, the algorithm has the high search efficiency and low false alarm rate.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.4
• /
• pp.20-27
• /
• 2010

This paper proposes a saturation compensating method by embedding pseudo-random code information in wavelet packet based colorization algorithm. In the color-to-gray process, an input RGB image is converted into YCbCr images, and a 2-level wavelet packet transform is applied to the Y image. And then, color components of CbCr are embedded into two sub-bands including minimum amount of energy on the Y image. At this time, in order to compensate the color saturations of the recovered color image during the printing and scanning process, the maximum and minimum values of CbCr components of an original image are also embedded into the diagonal-diagonal sub-band by a form of pseudo-random code. This pseudo-random code has the maximum and minimum values of an original CbCr components, and is expressed by the number of white pixels. In the gray-to-color process, saturations of the recovered color image are compensated using the ratio of the original CbCr values to the extracted CbCr values. Through the experiments, we can confirm that the proposed method improves color saturations in the recovered color images by the comparison of color difference and PSNR values.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.241-242
• /
• 2009

As software is becoming increasing important to the human society, so does the effort to produce them is also increasing.. All of these efforts can be at risk when source code of the application is reverse engineered by the software pirate. Many attempts have been made to protect Intellectual Property Rights (IPR); one of the newest attempts to protect IPR is software watermarking. It is used to prove ownership right when IPR are violated, and also prevents the bandit from altering the code for his own use. In this paper we are presenting a new technique for software watermarking know as Dictionary Based Software Watermarking (DBSW). DBSW works by embedding dummy instructions in source code with the help of predefined mapping already available in the dictionary. These instructions are identical to the normal instructions of the program and are hard to identify or to extract from the watermarked program. With the help of DBSW we not only can stop source code alteration but can also identify the buyer how has distributed the pirated copy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.6
• /
• pp.2554-2575
• /
• 2020

Data hiding technology hides secret information into the carrier, so that when the carrier is transmitted over network, it will not attract any malicious attention. Using data compression, it is possible to reduce the data size into a small compressed code, which can effectively reduce the time when transmitting compressed code on the network. In this paper, the main objective is to effectively combine these two technologies. We designed a data hiding scheme based on two techniques which are turtle-shell information hiding scheme and absolute moment block truncation coding. The experimental results showed that the proposed scheme provided higher embedding capacity and better image quality than other hiding schemes which were based on absolute moment block truncation coding.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.12
• /
• pp.6159-6174
• /
• 2019

Recently, Kim et al. introduced the Hamming + k with m overlapped pixels data hiding (Hk_mDH) based on matrix encoding. The embedding rate (ER) of this method is 0.54, which is better than Hamming code HC (n, n - k) and HC (n, n - k) +1 DH (H1DH), but not enough. Hamming code data hiding (HDH) is using a covering function COV(1, n = 2^k -1, k) and H1DH has a better embedding efficiency, when compared with HDH. The demerit of this method is that they do not exploit their space of pixels enough to increase ER. In this paper, we increase ER using sequential Hk_mDH (SHk_mDH ) through fully exploiting every pixel in a cover image. In SHk_mDH, a collision maybe happens when the position of two pixels within overlapped two blocks is the same. To solve the collision problem, in this paper, we have devised that the number of modification does not exceed 2 bits even if a collision occurs by using OPAP and LSB. Theoretical estimations of the average mean square error (AMSE) for these schemes demonstrate the advantage of our SHk_mDH scheme. Experimental results show that the proposed method is superior to previous schemes.

• 한국전산유체공학회:학술대회논문집
• /
• 2008.03b
• /
• pp.268-271
• /
• 2008

If a reactor vessel is failed to retain a molten corium in a postulated severe accident, the molten corium is released outside the reactor vessel into a reactor cavity. The molten corium would attack the concrete wall and basemat of the reactor cavity, which may lead to inevitable concrete decompositions and possible radiological releases. In the OECD/MCCI project, a series of tests were performed to secure the data for cooling the molten corium spread out at the reactor cavity and for the long-term CCI (Core Concrete Interaction). Also, a MCCI (Molten Core Concrete Interaction) analysis code, CORQUENCH was upgraded at Argonne National Laboratory with embedding the new models developed for the tests. This paper deals with analyses of MCCI at plant scale under the conditions of top flooding using the upgraded CORQUENCH code. The modeling approach is briefly summarized first, followed by presentation of a validation calculation that illustrates the predicative capability of the modeling tool. With this background in place, the model is then used to carry out a parametric set of scoping calculations that define approximate coolability envelopes for the LCS (Limestone Common Sand) concrete that has been evaluated in the OECD/MCCI project.