• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.46-49
• /
• 2000

An iterative deblocking algorithm for DCT-compressed images using two-dimensional FIR filters adapted for local directionality of each block, is proposed. First, we introduce a set of simple lowpass filters, which are adapted for edges of different angles. In conventional deblocking methods based on lowpass-filtering and convex projections, a single filter is applied to a whole image. In the proposed method, on the other hand, a suitable filter is chosen out of the directional filters designed previously in every subimage (typically $8{\times}8$ block). Experimental results indicate that adaptive filtering improves PSNR at each iteration.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.1
• /
• pp.79-86
• /
• 2003

A new quantization constraint set based on the theory of Projection onto Convex Set(POCS) is proposed to reduce blocking artifact appearing in block-coded images. POCS-based postprocessing for alleviating the blocking artifact consists of iterative projections onto smoothness constraint set and quantization constraint set, respectively. In general, the conventional quantization constraint set has the maximum size of range where original image data can be included, therefore over-blurring of restored image is unavoidable as iteration proceeds. The projection onto the proposed quantization constraint set can reduce blocking artifact as well as maintain the clearness of the decoded image, since it controls adaptively the size of quantization constraint set according to the DCT coefficients. Simulation results using the proposed quantization constraint set as a substitute for conventional quantization constraint set show that the blocking artifact of the decoded image can be reduced by the small number of iterations, and we know that the postprocessed image maintains the distinction of the decoded image.

• Journal of Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1521-1530
• /
• 2004

In this paper, we present effective quantization noise reduction algorithm using signal adaptive filter and linear combination between blocks in multimedia system. In the proposed method, all of the blocks are classified into low frequency blocks, high frequency blocks, and midrange blocks according to DCT coefficients. Ringing artifacts are shown in high frequency blocks. So ringing artifact reduction algorithm is performed in high frequency blocks using a signal adaptive filter. And the blocking artifact reduction is performed by replacing the pixel value of blocky blocks using linear combination between blocky block and remote unblocky block. The simulation results shows better performance in respective of the subjective and objective image quality than the conventional method.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.5
• /
• pp.232-242
• /
• 2005

This paper concerns automatic hardware synthesis from data flow graph (DFG) specification for fast HW/SW cosynthesis. A node in BFG represents a coarse grain block such as FIR and DCT and a port in a block may consume multiple data samples per invocation, which distinguishes our approach from behavioral synthesis and complicates the problem. In the presented design methodology, a dataflow graph with specified algorithm can be mapped to various hardware structures according to the resource allocation and schedule information. This simplifies the management of the area/performance tradeoff in hardware design and widens the design space of hardware implementation of a dataflow graph compared with the previous approaches. Through experiments with some examples, the usefulness of the proposed technique is demonstrated.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11C
• /
• pp.917-924
• /
• 2008

Motion estimation and compensation in the spatial domain check the searching area of specified size in the previous frame and search block to minimize the difference with current block. When we check the searching area, it consumes the most encoding times due to increasing the complexity. We can solve this fault by means of motion estimation using shifting matrix in the transform domain instead of the spatial domain. We derive so the existed shifting matrix to a new recursion equation that we decrease more computations. We modify simply vertical shifting matrix and horizontal shifting matrix in the transform domain for motion estimation of half-pixel accuracy. So, we solve increasing computation due to bilinear interpolation in the spatial domain. Simulation results prove that motion estimation by the proposed algorithm in DCT-based transform domain provides higher PSNR using fewer bits than results in the spatial domain.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.284-289
• /
• 2008

H.264/AVC among moving picture compression standard is the standard format for high compression rate and reliable video transimission. It generates blocking effects in video due to compressing video using block-based DCT and includes de-blocking filter to reduce blocking effect. Therefore, the filter makes the video over-smoothing and the quality of it is reduced. In this paper, we propose a improved de-blocking filter to solve the demerit. The proposed de-blocking filter redetermine the block boundary strength and apply the comer filtering to eliminate artifacts in low frequency domain. To evaluate the performance, we apply the proposed deblocking filter and exiting method to various video and evaluated the quality of image subjectively and objectively by analyzing the result. The simulation result shows the proposed method preserves the edge of video, reduces blocking effects and improves PSNR than the existing method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.3
• /
• pp.14-20
• /
• 2002

In this paper, we proposed the compression technique of the video data using SPIHT(set partitioning in hierarchical trees) based on wavelet and the multi-stream delivery method for best-effort service as fully utilizing the clients bandwidth over the current Internet. The experiment shows that the proposed method provides about 1.5dB better picture quality without block effects than DCT(discrete consine transform) based coding schemes at the same bit rates because of using the wavelet video coder. In addition, this technique implements the multi-stream transmission based on TCP(transmission control protocol). Thus, it is provided with the best-efforts service which is robust to the network jitter problem, and maximally utilizes the bandwidth of the client's.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.4
• /
• pp.98-105
• /
• 1989

Various models incorporating Human Visual System (HVS) with the Hadamard transform (HT) represented by Walsh functions are considered. Using the exact frequency components of HT basis functions, the optimum modulation transfer function (MTF) which has a higher peak frequency than DCT schemes is obtimum modulation transfer function (MTF) which has a higher peak frequency than DCT schemes is obtained analytically and visually. The main criterion, for error measurement, is errors at the block boundaries which is an important factor in transform coding. The scheme which has no inverse HVS is proposed. It causes some degradation of image data but it is insignigicant. Crossing area of 4 blocks is equalized by the HVS weighting coefficients. The HVS weighted coding results in perceptually higher quality images compared with the unweighted scheme.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.7
• /
• pp.70-82
• /
• 1993

In this paper, employing the 3-dimensional discrete cosine transform (DCT) for the utilization of the temporal correlation, an adaptive motion sequence coding technique is proposed. The energy distribution in a 3-D DCT block, due to the nonstationary nature of the image data, varies along the veritical, horizontal and temporal directions. Thus, aiming an adaptive system to local variations, adaptive procedures, such as the 3-D classification, the classified linear scanning technique and the VLC table selection scheme, have been implemented in our approach. Also, a hybrid structure which adaptively combines inter-frame coding is presented, and it is found that the adaptive hybrid frame coding technique shows a significant performance gain for a moving sequence which contains a relatively small moving area. Through an intensive computer simulation, it is demonstrated that, the performance of the proposed 3-D transform coding technique shows a close relation with the temporal variation of the sequence to be code. And the proposed technique has the advantages of skipping the computationally complex motion compensation procedure and improving the performance over the 2-D motion compensated transform coding technique for rates in the range of 0.5 ~ 1.0 bpp.

• Journal of the Korea Computer Graphics Society
• /
• v.6 no.3
• /
• pp.35-40
• /
• 2000

There are two problems in H.26X compression technique. One is compressing time in encoding process and the other is degradation of the decoded video quality due to high compression rate. For transferring moving pictures in real-time, it is required to adopt massively high compression. In this case, there are a lot of losses of an original video data and that results in degradation of quality. Especially degradation called by blocking artifact may be produced. The blocking artifact effect is produced by DCT-based coding techniques because they operate without considering correlation between pixels in block boundaries. So it represents discontinuity between adjacent blocks. This paper describes methods of quality compensation for H.26x decoded data and enhancing encoding speed for real-time operation. Our goal of the quality compensation is not to make the decoded video identical to a original video but to make it perceived better through human eyes. We suggest an algorithm that reduces block artifact and clears decoded video in decoder. To enhance encoding speed, we adopt new four-step search algorithm. As shown in the experimental result, the quality compensation provides better video quality because of reducing blocking artifact. And then new four-step search algorithm with $MMX^{TM}$ implementation improves encoding speed from 2.5 fps to 17 fps.