• Journal of Biomedical Engineering Research
• /
• v.12 no.3
• /
• pp.215-222
• /
• 1991

In this paper, we present a result of our study on how to construct a pilot MPACS (medical hic lure archiving and communication System) based on X -Window system. The proposed MPACS Is composed of image acquisition units, image archiving and processing units, display units, and all units are Interfaced with a LAN The image management is done according to the TIFF (Tagged Image File Format) , and the dis- play system is built upon generally accepted software packages, namely the X -Window system. Also, lossless and lossy digital image compression methods were implemented and tested with X -ray and CT images.

• Proceedings of the IEEK Conference
• /
• 2002.06d
• /
• pp.219-222
• /
• 2002

In this paper, we propose a new blind image watermarking method in wavelet domain. It is necessary to find out watermark insertion location in blind watermark. We use horizontal and vertical difference of LL components to select watermark insertion location, because increment or decrement of successive components is rarely changed in LL band. A pseudo-random sequence is used as a watermark. Experimental results show that the proposed method is robust to various kinds of attacks such as JPEG lossy compression, averaging, median filtering, resizing, histogram equalization, and additive Gaussian noise.

• Proceedings of the IEEK Conference
• /
• 2004.08c
• /
• pp.631-635
• /
• 2004

The rapid development of digital media and communication network urgently brings about the need of data certification technology to protect IPR (Intellectual property right). This paper proposed a new watermarking method for embedding contents owner's audio signal in order to protect color image IPR. Since this method evolves the existing static model and embeds audio signal of big data, it has the advantage of restoring signal transformed due to attacks. Three basic stages of watermarking include: 1) Encode analogue ID owner's audio signal using PCM and create new 3D audio watermark; 2) Interleave 3D audio watermark by linear bit expansion and 3) Transform Y signal of color image into wavelet and embed interleaved audio watermark in the low frequency band on the transform domain. The results demonstrated that the audio signal embedding in color image proposed in this paper enhanced robustness against lossy JPEG compression, standard image compression and image cropping and rotation which remove a part of image.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2012.05a
• /
• pp.40-42
• /
• 2012

Colorization is a method using computer to add color to a black and white image automatically. The input is a grayscale image and some representative pixels (RPs). The RPs contain the color information for the image, and it indicates each region's color information. Colorization-based coding is a novel way for lossy image compression, it decodes a color image to get grayscale image and extracts RPs from the image. Because RPs decides the region's color and we also want small data size for image compression, form this viewpoint the paper proposes a way to get better and fewer RPs based on watershed segmentation. According to the segmentation result we also improve the original chrominance blending colorization method to save decode time and get better reconstruct image.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.7-12
• /
• 2009

In JPEG2000, the Cohen-Daubechies-Feauveau (CDF) 9/7-tap wavelet filter adopted in lossy compression is implemented by the lifting scheme or by the convolution scheme while the LeGall 5/3-tap wavelet filter adopted in lossless compression is implemented just by the lifting scheme. However, these filters are not optimal in terms of Peak Signal-to-Noise Ratio (PSNR) values, and irrational coefficients of wavelet filters are complicated. In this paper, we proposed a method to optimize image quality based on wavelet filter design and on wavelet decomposition. First, we propose a design of wavelet filters by selecting the most appropriate rational coefficients of wavelet filters. These filters are shown to have better performance than previous wavelet ones. Then, we choose the most appropriate wavelet decomposition to get the optimal PSNR values of images.

• Journal of the Korea Computer Graphics Society
• /
• v.15 no.3
• /
• pp.11-18
• /
• 2009

In this paper, we introduce a novel method to extend the JPEG standard, which is the most widely used for lossy image compression, in order to improve compression ratio. To employ two of the most successful methodologies for the data compression: differential coding and quantization simultaneously, we propose a line-based approach. For each line in a block, we apply one-dimensional discrete cosine transformation to the increments instead of the pixel values. Those values are quantized and entropy-coded similarly to the JPEG standard. To further increase compression ratio, the proposed method is plugged into the JPEG standard to form a new compression method, in which the proposed method are applied to only selected JPEG blocks. In our experiment, we found that the proposed method outperform the JPEG standard when the qualities of the coded images are set to be high. We believe the proposed method can be simply plugged into the standard to improve its compression ratio for higher quality images.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.9-20
• /
• 2000

In this paper we compare two frequency domain digital watermarking methods for digital Images, namely DCT(Discrete Cosine Transform) based and DFT(Discrete Fourier Transform) based methods. Unlike DCT coefficients, which always have real values, DFT coefficients normally have complex values Therefore, the DFT coefficients have amplitude and phase components Among them, the phase components are known to carry more Important information for the Images. So, we insert the watermark to the phase of the DFT coefficients only This DFT watermarking method is compared with the conventional DCT based watermarking method for the object-based watermarking problem. Experimental results show that the DFT-phase based method IS more robust to general Image processing attacks including resize, lossy compression(JPEG), blurring and median filtering. On the other hand, the DCT based method is more robust to the malicious attack which inserts different watermarks.

• Journal of Internet Computing and Services
• /
• v.8 no.3
• /
• pp.33-43
• /
• 2007

In this proper, we proposes a robust watermarking against the lossy compression in the Hadamard domain. The Hadamard matrix consists of only 1 or -1 and can be computed veru fast. The Hadamrd transform has the inverse transform therefore it is able to be applied into the watermarking technology. In embedding process, we select 10 coefficients from intermediate frequency domain and create two watermark patterns. In extraction process, we use the watermark patterns and compare them to detect the watermark information. When we use the standard image ($512{\times}512$) and binary watermark image ($64{\times}64$), the results of these examines are PSNR for $38{\sim}42dB$ and BER for $3.9{\sim}12.5%$. The JPEG QF between 30 and100, naked human eyes can detect to watermark image easily. The experimental results show that performance of Hadamard domain is better than those of DCT, FFT, and DWT.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.598-601
• /
• 2002

In this research, robustness of image watermarking mixed Key and Logo scheme was evaluated. A personal ID of a copyrighter was key and watermark was logo image. The standard images of Baboon, Cameraman and Lena were used for experimental images, binary image‘Park’of 32$\times$32 and 64$\times$64 size were used for the watermark image, respectively. for robustness evaluation of the watermark, reconstructive rates of the watermark were obtained from images inserted watermark with image transformation or JPEG lossy compression. The experimental results show that the reconstructive rates of the case of 32$\times$32 watermark was better than the case of the 64$\times$64 watermark; average 5.9%, 13.9%, 6.5%, and 4.2% in the case of scale-down rates, rotational rates, impulse noise power density, and JPEG lossy compression rates, respectively.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.3
• /
• pp.290-297
• /
• 2009

This paper presents an improved adaptive multi-rate wideband (AMR-WB) algorithm for the efficient Text-To-Speech (TTS) database compression. The proposed algorithm includes unnecessary common bit-stream (CBS) removal and parameter delta coding combined with speaker-dependent huffman coding to reduce the required bit-rate without any quality degradation. We also propose lossy coding schemes to produce the maximum bit-rate reduction with negligible quality degradation. The proposed lossless algorithm including CBS removal can reduce bit-rate by 12.40% without quality degradation compared with the 12.65 kbps AMR-WB mode. The proposed lossy algorithm can reduce bit-rate by 20.00% with 0.12 PESQ degradation.