• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.13 no.3
• /
• pp.262-266
• /
• 2020

In this paper, we proposed an effective technique for hiding the watermark in the LSB of a color image by applying spatial encryption techniques. Even if the watermark hidden in the LSB of the image is extracted, the information of the extracted watermark cannot be decrypted because the watermark is encrypted using various spatial encryption techniques. Therefore, if the watermark is concealed in the LSB using the spatial encryption techniques proposed in this paper, the security is greatly improved compared to the existing technique of embedding the watermark in the LSB. When watermarking is performed by applying the proposed technique, the image quality of the watermark-concealed image is very good, so it is impossible to distinguish it from the original image, and the watermark, which is confidential data, can be extracted from the watermarked image without loss. The performance of the proposed technique was mathematically analyzed and the superiority of the proposed technique was confirmed through experiments. When the watermark was concealed by applying the proposed technique to Lenna, airplane, Tiffany, and pepper images having a size of 512×512, the PSNR values of the watermarked images were 53.91dB, 54.10dB, 54.09dB, and 54.13dB, respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2004

In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method and the random changing method using the chaotic system. For ciphering the quantization index we use a novel image encryption algerian of cyclically shifted in the right or left direction and encrypts two quantization assignment method (Top-down/Reflection code), made change of data less. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the proposed methods implemented in software for about 500 images. consequently, we are sure that the proposed are efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas. Also, because the proposed methods are performed in the application layer, they are expected to be a good solution for the end-to-end security problem, which is appearing as one of the important problems in the networks with both wired and wireless sections.

• Journal of Korea Society of Industrial Information Systems
• /
• v.15 no.3
• /
• pp.51-57
• /
• 2010

Steganography techniques can be used to hide data within digital images with little or no visible change in the perceived appearance of the image. I propose a steganalysis to detecting hidden message in sequential steganography. This paper presents adjusted technique for detecting abrupt jumps in the statistics of the stego signal during steganalysis. The repeated statistical test based on CUSUM-SPRT runs constantly until it reaches decision. In this paper, I deal with a new and improved statistic $g_t$ by computing $S^{t^*}_j$.

• The Journal of the Acoustical Society of Korea
• /
• v.21 no.8
• /
• pp.719-726
• /
• 2002

In this paper, we present a layered watermarking technique for digital audio data that is capable of detecting timing change and adapting complexity in detection. The proposed watermarking uses echo hiding as the first layer, which enables the detector to estimate linear speed change. The spread spectrum watermark is then inserted in the second layer which includes additional information like copyright data. We use two kinds of sequences in the second layer, one of which is for synchronization and the other is for data. The results of previous layer are used to make estimate of timing change in the next layer. The detector in the presented method can select detecting range form the first layer to the first layer, second pre-layer, or second main-layer due to the required system specification. Experimental results show that the proposed watermarking technique is robust to several processing attacks including timing change.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3885-3895
• /
• 2000

The emergence of digital imaging and digital networks has made duplication of original artwork easier. In order to protect these creations, new methods for signing and copyrighting visual data are needed. In the last few years, a large number of schemes have heen proposed for hiding copyright marks and other information in digital image, video, audio and other multimedia objects. In this paper, we propose a technique for embedding the watermark of visually recognizable patterns into the frequency domain of images. The embedded watermark can be retrieved from the decoded sequence witbout knowledge of the original. Because the source image is not required to extract the watermark, one cannot make the fake original that is invertible to watermarking scheme from the waternlarked image. In order to recover the embedded signature data without knowledge of the original, a prediction of the original value of the pixel containing the information is needed. The prediction is based on a averaging of amplitude values in a neighborhood around the pixel itself. Additionally the projxJsed technique could survive several kinds of image processings including JPEG lossy compression.

• Journal of KIISE
• /
• v.44 no.8
• /
• pp.767-773
• /
• 2017

In a distributed system environment, such as a cloud database, the tail latency needs to be kept short to ensure uniform quality of service. In this paper, through experiments on a Cassandra database, we show that long tail latency is caused by a lack of memory space because the database cannot receive any request until free space is reclaimed by writing the buffered data to the storage device. We observed that, since the performance of the storage device determines the amount of time required for writing the buffered data, the performance degradation of Solid State Drive (SSD) due to garbage collection results in a longer tail latency. We propose a garbage collection synchronization technique, called SyncGC, that simultaneously performs garbage collection in the java virtual machine and in the garbage collection in SSD concurrently, thus hiding garbage collection overheads in the SSD. Our evaluations on real SSDs show that SyncGC reduces the tail latency of $99.9^{th}$ and, $99.9^{th}-percentile$ by 31% and 36%, respectively.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.27-36
• /
• 2006

Lossless data embedding is a method to insert information into a host image that guarantees complete restoration when the extraction has been done. In this paper, we propose a noble reversible data embedding algorithm for images in wavelet domain. The proposed embedding technique, which modifies histogram of wavelet coefficient, is composed of two inserting steps. Data is embedded to wavelet coefficient using modification of histogram in first embedding process. Second embedding step compensates the distortion caused by the first embedding process as well as hides more information. Hence we achieve higher inserting capacity. In view of the relationship between the embedding capacity and the PSNR value, our proposed method shows considerably higher performance than the current reversible data embedding methods.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.4
• /
• pp.856-873
• /
• 2011

Reversible watermarking is an open problem in information hiding field, with embedding the encoded bit '1' or '0' into some sensitive images, such as the law enforcement, medical records and military images. The technique can retrieve the original image without distortion, after the embedded message has been extracted. Histogram-based scheme is a remarkable breakthrough in reversible watermarking schemes, in terms of high embedding capacity and low distortion. This scheme is lack of capacity control due to the requirement for embedding large-scale data, because the largest hidden capacity is decided by the amount of pixels with the peak point. In this paper, we propose a reversible watermarking scheme to enlarge the number of pixels with the peak point as large as possible. This algorithm is based on an adaptive edge-guided interpolation, furthermore, hides messages by interpolation-error, i.e. the difference between the original and interpolated image value. Simulation results compared with other state-of-the-art reversible watermarking schemes in this paper demonstrate the validity of the proposed algorithm.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.244-253
• /
• 2017

Reversible DNA watermarking is capable of continuous DNA storage and forgery prevention, and has the advantage of being able to analyze biological mutation processes by external watermarking by iterative process of concealment and restoration. In this paper, we propose a reversible DNA watermarking method based on histogram multiple shifting of noncoding DNA sequence that can prevent false start codon, maintain original sequence length, maintain high watermark capacity without biologic mutation. The proposed method transforms the non-coding region DNA sequence to the n-th code coefficients and embeds the multiple bits of the n-th code coefficients by the non-recursive histogram multiple shifting method. The multi-bit embedding process prevents the false start codon generation through comparison search between adjacent concealed nucleotide sequences. From the experimental results, it was confirmed that the proposed method has higher watermark capacity of 0.004-0.382 bpn than the conventional method and has higher watermark capacity than the additional data. Also, it was confirmed that false start codon was not generated unlike the conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.4
• /
• pp.301-314
• /
• 1990

This paper is an attempt to use vision-pattern recognition technique to analyzation on a hidden rigid body motion. Specially shaped rod, rigidly connected to the hidden body is extended to the ouside of hiding object so that a camera may catch the motion data. Every motion can be described with translatio and rotation. But translation can be explanied with ratation with a infinitly far centroid. Motion analysis is to find the instantaneous centroid and ratation angle. With this theory jaw motion is analyzed in this paper.