• IEIE Transactions on Smart Processing and Computing
• /
• v.5 no.5
• /
• pp.323-326
• /
• 2016

High Efficiency Video Coding (HEVC) adopts intra transform skip mode, in which a residual block is directly quantized in the pixel domain without transforming the block into the frequency domain. Intra transform skip mode provides a significant coding gain for screen content. However, when intra-prediction errors are not transformed, the errors are often correlated along the intra-prediction direction. This paper introduces a residual differential pulse code modulation (DPCM) method for the intra-predicted and transform-skipped blocks to remove redundancy. The proposed method performs pixel-by-pixel residual prediction along the intra-prediction direction to reduce the dynamic range of intra-prediction errors. Experimental results show that the transform skip mode's Bjøntegaard delta rate (BD-rate) is improved by 12.8% for vertically intra-predicted blocks. Overall, the proposed method shows an average 1.2% reduction in BD-rate, relative to HEVC, with negligible computational complexity.

• Journal of KIISE:Software and Applications
• /
• v.31 no.7
• /
• pp.901-910
• /
• 2004

In this paper, we propose a content-based MPEG transcoding method using a discontinuity feature in the Discrete Cosine Transform (DCT) domain. A DCT block is transcoded differently depending on the height of dominant discontinuity within a block. In the experiment, we show the result that the video quality of content-based transcoding is better than that of a constant cut-off method and the processing time of the adaptive method is much faster compared with the pixel domain methods in the same bandwidth.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2018.05a
• /
• pp.107-110
• /
• 2018

Image compression is the application of Data compression on digital images. The (DCT) discrete cosine transform is a technique for converting a time domain to a frequency domain. It is widely used in image compression. First, the image is divided into 8x8 pixel blocks. Apply the DCT to each block while processing from top to bottom from left to right. Each block is compressed through quantization. The space of the compressed block array constituting the image is greatly reduced. Reconstruct the image through the IDCT. The purpose of this research is to understand compression/decompression of images using the DCT method.

• Proceedings of the IEEK Conference
• /
• 2000.11d
• /
• pp.155-158
• /
• 2000

In this paper, the quantization noise in block-based video coding is analyzed, and a post-processing method based on the analysis is presented for reducing the quantization noise by using a wavelet transform(WT). In the proposed method, the quantization noise is considered as the sum of a blocking noise expressed as a deterministic profile and the random remainder noise. Each noise is removed in a viewpoint of image restoration using a 1-D WT, which yields a regularized differentiation. The blocking noise first is reduced by weakening the strength of each blocking noise component that appears as an impulse in the first scale wavelet domain. The impulse strength estimation is performed using median filter, quantization parameter(QP), and local activity. The remainder noise, which is considered as a white noise at non-edge pixels, then is reduced by soft-thresholding. The experimental results show that the proposed method yields better performance in terms if subjective quality as well as PSNR performance over VM post-filter in MPEG-4 for all test sequences of various compression ratios. We also present a fast post-processing in spatial domain equivalent to that in wavelet domain for real-time application.

• Journal of Korea Multimedia Society
• /
• v.17 no.12
• /
• pp.1402-1411
• /
• 2014

Buyer-seller watermarking protocol is defined as the practice of imperceptible altering a digital content to embed a message using watermarking in the encryption domain. This protocol is acknowledged as one kind of copyright protection techniques in electronic commerce. Buyer-seller watermarking protocol is fundamentally based on public-key cryptosystem that is operating using the algebraic property of an integer. However, in general usage, digital contents which are handled in watermarking scheme mostly exist as real numbers in frequency domain through DCT, DFT, DWT, etc. Therefore, in order to use the watermarking scheme in a cryptographic protocol, digital contents that exist as real number must be transformed into integer type through preprocessing beforehand. In this paper, we presented a new watermarking scheme in an encrypted domain in an image that is based on the block-DCT framework and homomorphic encryption method for buyer-seller watermarking protocol. We applied integral-processing in order to modify the decimal layer. And we designed a direction-adaptive watermarking scheme by analyzing distribution property of the frequency coefficients in a block using JND threshold. From the experimental results, the proposed scheme was confirmed to have a good robustness and invisibility.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2000.12a
• /
• pp.125-128
• /
• 2000

The conventional fractal decoding was required a vast amount computational complexity. Since every range blocks was implemented to IFS(iterated function system). In order to improve this, it has been suggested to that each range block was classified to iterated and non-iterated regions. If IFS region is contractive, then it can be performed a fast decoding. In this paper, a searched region of the domain in the encoding is limited to the range region that is similar with the domain block, and IFS region is a minimum. So, it can be performed a fast decoding by reducing the computational complexity for IFS in fractal image decoding.

• Journal of Korea Multimedia Society
• /
• v.2 no.4
• /
• pp.409-418
• /
• 1999

The fractal image compression is based on the self-similarity that some area in an image exhibits a very similar shape with other areas. This compression technique has very long encoding time although it has high compression ratio and fast decompression. To cut-off the encoding time, most researches have restricted the search of domain blocks for a range block. These researches have been mainly focused on the coherence between a domain block and a range block, while they have not utilized the coherence among range blocks well. Therefore, we give an analysis on the coherence among range blocks in order to develope an efficient fractal Image compression algorithm. We analysis the range blocks according to not only measures for defining the range block coherence but also threshold of each measure. If these results are joined in a prior work of other fractal compression algorithms, it will give a great effectiveness in encoding time.

• Journal of the Korean Society of Radiology
• /
• v.8 no.1
• /
• pp.19-26
• /
• 2014

This paper suggests techniques to enhance coding time which is a problem in traditional fractal compression and to improve fidelity of reconstructed images by determining fractal coefficient through adaptive selection of block approximation formula. First, to reduce coding time, we construct a linear list of domain blocks of which characteristics is given by their luminance and variance and then we control block searching time according to the first permissible threshold value. Next, when employing three-level block partition, if a range block of minimum partition level cannot find a domain block which has a satisfying approximation error, we choose new approximation coefficients using a non-linear approximation of luminance term. This boosts the fidelity. Our experiment employing the above methods shows enhancement in the coding time more than two times over traditional coding methods and shows improvement in PSNR value by about 1-3dB at the same compression rate.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1985.10a
• /
• pp.215-219
• /
• 1985

• Economic and Environmental Geology
• /
• v.43 no.4
• /
• pp.349-358
• /
• 2010

For imaging complex subsurface structures such as salt dome, faults, thrust belt, and folds, seismic prestack reverse-time migration in depth domain is widely used, which is performed by the cross-correlation of shot-domain wavefield extrapolation with receiver-domain wavefield extrapolation. We apply the prestack reverse-time migration, which had been developed at KIGAM, to the seismic field data set of Block 5 in Jeju basin of Korea continental shelf in order to improve subsurface syncline stratigraphy image of the deep structures under the shot point 8km at the surface. We performed basic data processing for improving S/N ratio in the shot gathers, and constructed a velocity model from stack velocity which was calculated by the iterative velocity spectrum. The syncline structure of the stack image appears as disconnected interfaces due to the diffractions, but the result of the prestack migration shows that the syncline image is improved as seismic energy is concentrated on the geological interfaces.