• Proceedings of the KIEE Conference
• /
• 2008.04a
• /
• pp.91-92
• /
• 2008

본 논문에서는 기존의 H.264/AVC의 spatial 영역에서 Intra prediction 기법과 달리 H.264/AVC에서 사용하는 Integer DCT 영역에서 Intra prediction 기법을 제안한다. 이를 위하여 Integer DCT 영역에서 Intra prediction을 수행하는 모든 과정을 matrix multiplication으로 표현하여 Intra prediction을 수행하는 matrix를 유도한다. Intra prediction을 수행하는 matrix를 각 모드에 알맞게 설계하고, 이 matrix를 Integer DCT 영역에서 사용할 수 있도록 orthogonal한 Integer matrix를 설계한다. 실험을 통하여 제안한 Integer DCT 영역에서 Intra prediction 기법이 기존의 H.264/AVC의 spatial 영역에서 intra prediction 기법과 성능이 동일하면서 어떻게 matrix multiplication에 연산들을 포함시켜서 단순화 할 수 있는지를 보여주겠다. 또한 H.264/AVC에서 제공하는 intra prediction 각 모드에 대해 계산상 복잡도를 분석하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 1998.06a
• /
• pp.189-192
• /
• 1998

본 논문은 DCT (Discrete Cosine Transform) 영역에서의 압축 동영상 하향 전환기법 (down conversion)을 제안한다. DCT 영역에서의 하향 전환이 완전 복호화한 후 공간 영역에서 하향 전환하는 것보다 계산량 측면에서 상당한 이점이 있다. 또한 복호기 루프 내에서 영상 크기가 줄기 때문에 메모리의 부담을 덜 수 있다. 가장 간다한 방법으로서 복원된 영상의 화질이 약잔 떨어지더라도 계산량과 메모리를 줄이기 위해 8x8 DCT 블록의 저주파 영역의 4x4 DCT 계수만을 추출하여 4x4 IDCT하는 기법이 널리 알려져 있다. 본 논문에서는 변형된 4x4 IDCT 기저 함수를 이용한 새로운 DCT 영역에서의 하향 전환 기법을 제안한다. 모의실험을 통해 제안한 기법이 기존의 DCT 영역에서의 하향 전환기법과 같은 계산량 및 메모리로 향상된 PSNR을 갖는다는 것을 보인다.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.163-170
• /
• 2007

In this paper, We propose a new technique for extraction of moving objects included in compressed video signal. Moving object extraction is used in several fields such as contents based retrieval and target tracking. In this paper, in order to extract moving object blocks, motion vectors and DCT coefficients are used selectively. The proposed algorithm has a merit that it is no need of perfect decoding, because it uses only coefficients on the DCT transform domain. We used three test video sequences in the computer simulation, and obtained satisfactory results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.4
• /
• pp.323-335
• /
• 1992

In this paper, an adaptive cosine transform coding scheme which incorporate human visual properties into the coding scheme is investigated. Human vision is relatively sensitive to mid-frequency band, and insensitive to very low and very high frequency band. These property was mathematically modelled with MTF(Modulation Transfer Function) through many psychovisual experiment. DCT transforms energy in spatial domain into frequency domain, so can exploit the MTF very efficiently. Another well-known visual characteristics is spatial masking effect that visibility of noise is less in regions of high activity than in regions of low activity. Proposed coding scheme imploys quantization matrix which represent the properties of these spatial frequency response of human vision, and adaptively quality of an image. To compute the activity index of an image block, simple operation is performed in spatial domain, and according to activity index. block of low activity region is more exactly quantized relatively than that of high activity region. Results showed that, at low bit rate, the subjective quality of the reconstructed images by proposed coding scheme is acceptible than that of coding scheme without HVS properties.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.1-16
• /
• 1996

In this paper, by combining the motion compensated transform coding with the sub-band decomposition technique, we present a motion compensated sub-band coding technique(MCSBC) for image sequence coding. Several problems related to the MCSBC, such as a scheme for motion compensation in each sub-band and the efficient VWL coding of the DCT coefficients in each sub-band are discussed. For an efficient coding, the motion estimation and compensation is performed only on the LL sub-band, but the discrete cosine transform(DCT) is employed to encode all sub-bands in our approach. Then, the transform coefficients in each sub-band are scanned in a different manner depending on the energy distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distributions in the DCT domain, and coded by using separate 2-D Huffman code tables, which are optimized to the probability distribution of each sub-band. The performance of the proposed MCSBC technique is intensively examined by computer simulations on the HDTV image sequences. The simulation results reveal that the proposed MCSBC technique outperforms other coding techniques, especially the well-known motion compensated transform coding technique by about 1.5dB, in terms of the average peak signal to noise ratio.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.45 no.4
• /
• pp.1-9
• /
• 2008

This paper presents a rapid watermarking algorithm based on DC image, which provides a resilience to geometric distortion. Our proposed scheme is based on $8{\times}8$ block DCT that is widely used in image/video compression techniques (e.g., JPEG and MPEG). In particular, a DC image is analyzed by DWT to embed a watermark. To overcome a quality degradation caused by a watermark insertion into DC components, we discern carefully the intensity and amount of watermark along the different subbands of DWT. Note that the proposed technique supports a high throughput for a real-time watermark insertion and extraction by relying on a partial decoding (i.e., DC components) on $8{\times}8$ block DCT domain. Experimental result shows that the proposed watermarking scheme significantly reduces computation time of 82% compared with existing DC component based algorithm and yet provides invariant properties against various attacks such as geometric distortion and JPEG compression, etc.

• Journal of the Institute of Convergence Signal Processing
• /
• v.4 no.3
• /
• pp.34-40
• /
• 2003

The paper presents a method to detect dissolve shots of video scene change detections in an MPEG compressed domain. The proposed algorithm uses color-R DCT coefficients of Ⅰ, P-frames for a fast operation and accurate detection and a minimum decoding process in MPEG sequences. The paper presents a method to detect dissolve shot for three-dimensional visualization and analysis of Image in order to recognize easily in computer as a human detects accurately shots of scene change. First, Color-R DCT coefficients for 8*8 units are obtained and the features are summed in a row. Second, Four-step analysis are Performed for differences of the sum in the frame sequences. The experimental results showed that the algorithm has better detection performance, such as precision and recall rate, than the existing method using an average for all DC image by performing four step analysis. The algorithm has the advantage of speed, simplicity and accuracy. In addition. it requires less amount of storage.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.691-700
• /
• 1995

Most fractal image codings using fractal concept require long encoding time because a large amount of computation is needed to find an optimal affine transformation point. Such a problem can be solved by designing a block classifier fitted to characteristics of image blocks. In general, it is possible to predict more precise and various types of blocks in frequency domain than in spatial domain. In this paper, we propose a block classifier to predict the block type using characteristics of DCT(Discrete Cosine Transform). This classifier has merits to enhance the quality of decoded images as well as to reduce the encoding time meeting fractal features. AC coefficient values in frequency domain make it possible to predict various types of blocks. As the results, the number of comparisons between a range block and the correspoding domain blocks to reach an optimal affine transformation point can be reduced. Specially, signs of DCT coefficients help to find the optimal affine transformation point with only two isometric transformations by eliminating unnecessary isometric transformations among eight isometric transformations used in traditional fractal codings.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.11
• /
• pp.1477-1485
• /
• 2021

Recently, super-resolution has been intensively studied only on upscaling models with integer magnification. However, the need to expand arbitrary magnification is emerging in representative application fields of actual super-resolution, such as object recognition and display image quality improvement. In this paper, we propose a model that can support arbitrary magnification by using the weights of the existing integer magnification model. This model converts super-resolution results into the DCT spectral domain to expand the space for arbitrary magnification. To reduce the loss of high-frequency information in the image caused by the expansion by the DCT spectral domain, we propose a high-frequency attention network for arbitrary magnification so that this model can properly restore high-frequency spectral information. To recover high-frequency information properly, the proposed network utilizes channel attention layers. This layer can learn correlations between RGB channels, and it can deepen the model through residual structures.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.8
• /
• pp.2341-2348
• /
• 2000

The special effects on the compressed :vII'EG domain become one of the interesting problems. In this paper, we developed minimal deCilder to effect in DCT compressed domain, proposed the video effects including wipe, dissolve, and zooming. To increase the expandability and portabilitv, the minimal decoder and the effects arc implemented to filters of COM based DirectShow.