• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.2
• /
• pp.11-19
• /
• 2010

Most of deblocking filters assumes that the block boundaries are accurately known and the coding information like quantization parameters are available. In some applications such as commercial television, however, many external video inputs without known block boundary and coding information arc given. If a decompressed video sequence heavily degraded with blocking artifacts is given through the external video port, it is absolutely necessary to detect block boundaries and control the strength of deblocking filtering by analysing the given images. This paper presents an efficient method to find the block boundaries and estimate the strength of the blocking artifacts without the knowledge of coding information. In addition, the confidence of the estimated blocking artifact information is also evaluated to control the adaptive deblocking filter robustly. Experiment results show that the estimated block boundary locations and strength relative strength and confidence information are practically good enough to reduce the blocking artifacts without prior knowledge.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.1-9
• /
• 2010

In this paper, we propose an efficient compression method of the integral images. The integral imaging is a well-known technique to represent and record three-dimensional images. The proposed method is based on three dimensional discrete cosine transform (3D-DCT). The 3D-DCT techniques for the integral images have been reported as an efficient coding method for the integral images which reduces the redundancies between adjacent elemental images. The proposed method is a compression method efficient to integral images using adaptive block mode(ABM), based on the 3D-DCT technique. In the ABM, 3D-DCT blocks adaptive to the characteristics of integral images are constructed, which produces variable block size 3D-DCT blocks, and then 3D-DCTs for the 3D blocks are performed. Experimental results show that the proposed method gives significant improvement in coding efficiency. Especially, at the high bit-rates, the proposed method is more excellent since the overhead incurred by the proposed method take less part of the total bits.

• Journal of Broadcast Engineering
• /
• v.6 no.1
• /
• pp.108-118
• /
• 2001

In this paper, the conventional deblocing algorithms are compared in each region of the image. Based on the comparison result, we propose a new deblocklng algorithm that can improve subjectives as well as the objective quality. Because the human visual system is mode sensitive to the blocking artifacts in the low frequency re91on, we compare the performance of several deblocking algorithms in 7he low and high frequency region separately. For this purpose we also propose an algorithm for classifying the region into low and high frequency ones. and propose a deblocking algorithm which is applied differently to each region. The result shows that the adaptive LPF method yields the best performance in the low frequency region in terms of both subjective and objective quality. Hence. by applying the adaptive LPF method to the low frequency region, the performance of conventional algorithms can be improved. In the high frequency region. it is observed that the DCT-based POCS algorithm provides the best performance. Hence, by combining the algorithm with the adaptive LPF method, the best objective performance is obtained.

• Journal of Broadcast Engineering
• /
• v.15 no.5
• /
• pp.672-680
• /
• 2010

This paper presents an adaptive quantization matrix selection scheme for H.264 video encoding. Conventional H.264 coding standard applies the same quantization matrix to the entire video sequence without considering local characteristics in each frame. In this paper, we propose block adaptive selection of quantization matrix according to edge directivity of each block. Firstly, edge directivity of each block is determined using intra prediction modes of its spatially adjacent blocks. If the block is decided as a directional block, new weighted quantization matrix is applied to the block. Otherwise, conventional quantization matrix is used for quantization of the non-directional block. Since the proposed weighted quantization is designed based on statistical distribution of transform coefficients in accordance with intra prediction modes, we can achieve high coding efficiency. Experimental results show that the proposed scheme can improve coding efficiency by about 2% in terms of BD bit-rate.

• The Journal of the Korea Contents Association
• /
• v.12 no.9
• /
• pp.1-8
• /
• 2012

In this paper, we propose a rate-distortion optimization method to improve the coding efficiency of the conventional 3D-DCT based compression method using adaptive block mode selection for integral images. In the conventional 3D-DCT based compression method, 3D-DCT blocks of variable block sizes are adaptively selected depending on the characteristics of integral images, and then 3D-DCT is performed. The proposed method applies a rate-distortion optimization to determine the optimal block mode. In addition, we suggest the optimal Lagrangian parameter for integral images. Experimental results show that the proposed method gives bit-rate reduction of about 5%.

• Journal of Korea Society of Industrial Information Systems
• /
• v.24 no.1
• /
• pp.1-12
• /
• 2019

This paper proposes a new motion vector smoothing and motion compensation method to increase the frame rate of videos. The proposed method reduces false motion vector smoothing by improving the weight with reflecting accuracy to overcome the limitation of the conventional motion vector smoothing using the adaptively weighted vector median. Also, to improve the interpolated image quality of the conventional OBMC(Overlapped Block Motion Compensation), a scheme that divides an original block into 4 sub-blocks and then generates the interpolated frame using the reestimated motion vector for each sub-block is proposed. The simulation results prove that the proposed method can provide much better objective and subjective image quality than the conventional method.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.4 s.304
• /
• pp.119-126
• /
• 2005

We propose a new content-based image retrieval using a representative color histogram and directional pattern histogram that is adaptive to the classification characteristics of the image blocks. In the proposed method the color and pattern feature vectors are extracted according to the characteristics o: the block classification after dividing the image into blocks with a fixed size. First, the divided blocks are classified as either luminance or color blocks depending on the saturation of the block. Thereafter, the color feature vectors are extracted by calculating histograms of the block average luminance co-occurrence for the luminance block and the block average colors for the color blocks. In addition, block directional pattern feature vectors are extracted by calculating histograms after performing the directional gradient classification of the luminance. Experimental results show that the proposed method can outperform the conventional methods as regards the precision and the size of the feature vector dimension.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2010.11a
• /
• pp.262-265
• /
• 2010

본 논문에서는 그래픽 하드웨어와 그래픽 프로그램 기술을 이용하여 고속으로 스테레오 영상의 시차를 추정하는 기법을 제안한다. 우선, 컬러 스테레오 영상에 대하여 mean-shift 기법을 이용하여 컬러를 이용한 영역분할을 수행한다. 분할된 컬러 영역 단위로 가중치를 계산함으로써, 화소단위로 가중치를 계산하는 기존의 방식에 비하여 속도를 높일 수 있다. 블록정합함수를 계산하는 과정에서는 슬라이딩 윈도우 방식을 채택하여, 새로 블록안으로 들어오는 화소열과 빠져나가는 화소열의 정합함수값을 가감하여 화소마다 반복적으로 합산되는 정합함수의 계산량을 크게 줄인다. Middlebury 스테레오 영상을 이용하여 실험 및 평가를 수행한 결과, VGA 급 스테레오 영상을 기준으로 10 프레임 이상을 처리하면서도 기존의 적응적인 가중치를 갖는 블록정합 방식의 성능과 유사한 결과를 확인하였다. 이러한 고속화 방법을 통하여, 기존의 적응적인 가중치를 이용한 블록정합 방식에 비하여 훨씬 고속으로 스테레오 정합을 수행할 수 있으며, 실시간 시차추정이 필요한 시스템에 적용하는 것이 가능하다.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.55-58
• /
• 2001

기존에 MPEG-1, 2나 H.261/263 등에 사용되고있는 움직임 예측 방법은 블록 기반의 코딩 방식으로 단순히 영상의 움직임을 선형 모델로 간주하고 영상을 일정한 크기의 사각형으로 나누어, 각 사각형이 어느 곳으로 이동하는지를 추정하는 방식이었다. 그러나 이러한 방식은 블록 당 하나의 움직임 벡터만으로 처리하기 때문에 블록 내의 복잡한 움직임은 추정할 수 없을 뿐만 아니라, 보다 일반적인 움직임인 회전, 뒤틀림, 확대, 축소 등을 추정할 수 없다. 또한, 영상의 내용에 상관없이 일정한 크기의 블록으로 나누어 처리하기 때문에 주어진 영상에 최적화된 움직임 추정을 수행하기가 어렵다. 특히 저속 비트율에서는 이러한 점들이 크게 부각된다. 이러한 점들을 극복하기 위해서 여기에서는 삼각형 메쉬를 이용한 공간 변환 방법을 이용하였다. 여기에 영상을 영상에 따라 적응적으로 분해하여 처리할 수 있는 웨이브렛 패킷 부호화를 사용하여 에너지가 많고 적음에 따라 초기 제어점의 격자를 조절하여 좀 더 우수한 성능을 얻을 수 있다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1996.10a
• /
• pp.61-65
• /
• 1996

본 논문은, 공간영역에서 화상을 압축할 수 있는 Quad-tree 부호화법을 분석하고, 보다 화질 및 압축율을 개선하기 위하여 적응 불록분할 및 병합 알고리듭을 제안하엿다. 화상은 에지부분을 제외하고는 인접한 화소들간에 데이터의 용장도가 높으므로 이 영역을 하나의 대표값으로 설정하여 그 값과 그 블록의 위치좌표를 부호화할 수 있다. Quad-tree 분할은 초기의 병합을 제외하고 순차적으로 분할과정만 반복처리하지만 본 알고리듬에서는 단위블록(3$\times$3 호소) 의 평균잘류에너지(MRE)를 이용하여 블록의 분할과 병합을 반복처리한다. 시뮬레이션결과, 본 알고리듭은 압축율 1bit/pixel에서 기존의 Quad-tree 방법보다 PSNR에서 1.0dB의 개선이 있었으며, 화상의 블록화 현상도 전혀 나타나지 않았다.