• The KIPS Transactions:PartB
• /
• v.10B no.3
• /
• pp.321-328
• /
• 2003

This Paper Proposes a size-variable block matching algorithm for motion vector extraction. The Proposed algorithm dynamically determines the search area and the size of a block. We exploit the constraint of small velocity changes of a block along the time to determine the origin of the search area. The range of the search area is adjusted according to the motion coherency of spatially neighboring blocks. The process of determining the sire of a block begins matching with a small block. If the matching degree is not good enough, we expand the size of a block a little bit and then repeat the matching process until our matching criterion Is satisfied. The experimental results show that the proposed algorithm can yield very accurate block motion vectors. Our algorithm outperforms other algorithms in terms of the estimated motion vectors, though our algorithm requires some computational overhead.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2001.11a
• /
• pp.12-17
• /
• 2001

본 논문에서는 낮은 대역폭의 무선 네트워크상에서 MPEG 스트리밍을 위한 방법으로, DCT 계수의 제거에 기반한 QoS 필터링 방법과 매크로 블록상의 움직임 벡터와 인트라 블록의 비율을 고려한 영상분식을 통하여 분석된 내용에 가장 알맞는 필터의 선택과 필터의 적용 수준을 네트워크의 상태에 따라 결정하여 대역폭을 만족시킬 수 있는 비트레이트의 조절로서 원활한 스트리밍을 가능하게 하며 영상분석을 통하여 영상의 품질을 높여 고품질의 영상 멀티미디어 서비스와 최소한의 부하를 줄 수 있는 설계로서 서버운용시 과효율을 놀일 수 있도록 한다.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.89-95
• /
• 2009

H.264/AVC is the state-of-the-art video compression standard which achieves high coding efficiency compared with the previous standards. H.264/AVC adopts zig-zag scanning in order to encode quantized transform coefficients in a block. However, its performance is not satisfactory because all blocks are scanned in the fixed order without considering the characteristics of blocks. This paper presents an adaptive coefficient scanning method for improving inter coding efficiency in H.264/AVC. In the proposed method, the coefficient scanning order for each prediction mode is adaptively controlled based on the information of previously-coded blocks. The experimental results show that the proposed coefficient scanning method improves the coding efficiency about 2.29% for high-quality HD sequences.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.6 s.312
• /
• pp.57-64
• /
• 2006

Motion estimation plays an important role for the compression of video signals. The proposed method utilizes an adaptive threshold and characteristics of a distribution of SAD (sum of absolute difference). Generally, the more complex the SAD distribution is, the larger SAD value tends to be. This proposed algorithm tries to reduce the search points in a simple distribution but increase them in a complex distribution to avoid local minima. A macro block is divided into 9 areas. One of them chosen using spatio-temporal correlation is called the primary area and the others are called the secondary area that will be searched to avoid local minima. The proposed algorithm decides if just one area (the primary area or the secondary area) will be enough to be searched or both areas should be searched, using adaptive threshold. Compared with famous motion estimation algorithms, the simulation result shows that the searching points per macro block and MSE decreases about 16.4% and 32.83 respectively on the average.

• Journal of Internet Computing and Services
• /
• v.21 no.4
• /
• pp.43-49
• /
• 2020

This paper proposes a lossless image compression method based on arithmetic coding using block-adaptive Context Tree Weighting. The CTW method predicts and compresses the input data bit by bit. Also, it can achieve a desirable coding distribution for tree sources with an unknown model and unknown parameters. This paper suggests the method to enhance the compression rate about image data, especially aerial and satellite images that require lossless compression. The value of aerial and satellite images is significant. Also, the size of their images is huger than common images. But, existed methods have difficulties to compress these data. For these reasons, this paper shows the experiment to prove a higher compression rate when using the CTW method with divided images than when using the same method with non-divided images. The experimental results indicate that the proposed method is more effective when compressing the divided images.

• Journal of Korea Multimedia Society
• /
• v.7 no.10
• /
• pp.1378-1388
• /
• 2004

This paper proposes method to improve the image quality degradation that show when reconstructing compressed images at low bit rate by using wavelet transform. The image quality distortion is blocking artifacts and noise in DCT's compression but blocking artifacts of wavelet transform does not appear and ringing artifacts was appeared near the edge. This proposed technique is classified to part which is ringing artifacts of the edge vicinity appears which is not, apply adaptive filter to each region improved image. A edge region which is harsh to the eye is applied by Canny mask and finding strong edge region, search the neighborhood classify the flat region and the texture region, and apply to each region suitable filter, As experiment result, PSNR value of method that is proposed in that low bit rate compression image that ringing artifact appears became low about 0.05db, but 0.023db degree rose strong edge region and nat region's image. Also, showed picture quality improved more than ringing artifacts in nat region when see from subjective viewpoint of human.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.683-691
• /
• 2004

To transmit MPEG-2 video on an errorneous channel, a number of error control techniques are needed. Especially, error concealment techniques which can be implemented on receivers independent of transmitters are essential to obtain good video quality. In this paper, prediction of motion vector and an adaptive boundary matching algorithm are presented for temporal error concealment. Before the complex BMA, we perform error concealment by a motion vector prediction using neighboring motion vectors. If the candidate of error concealment is not satisfied, search range and reliable boundary pixels are selected by the temporal activity or motion vectors and a damaged macroblock is concealed by applying an adaptive BMA. This error concealment technique reduces the complexity and maintains a PSNR gain of 0.3∼0.7㏈ compared to conventional BMA.

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

H.264 video coding standard is widely used due to the high compression rate and quality. H.264 decoders usually have pipeline architecture by a macroblock or a $4{\times}4$ sub-block. The period of the pipeline is usually fixed to guarantee the operation in the worst case which results in many idle cycles and the requirement of high data bandwidth and high performance processing units. We propose adaptive pipeline architecture for H.264 decoders for efficient decoding and lower the requirement of the bandwidth for the memory bus. Parameters and coefficients are delivered using hand-shaking communication through dedicated interconnections and frame pixel data are transferred using AMBA AHB network. The processing time of each block is variable depending on the characteristics of images, and the processing units start to work whenever they are ready. An H.264 decoder is designed and implemented using the proposed architecture to verify the operation using an FPGA.

• Journal of Digital Contents Society
• /
• v.8 no.4
• /
• pp.441-449
• /
• 2007

In video coding, motion estimation is a process to estimate the pixel of the current frame from the reference frame, which affects directly the predictive quality and the encoding time. This paper is related to AHHS(Adaptive Hierarchical Hexagon Search) using spatio-temporal motion activity for fast motion estimation. The proposed method defines the spatio-temporal motion activity of the current macroblock using the motion vectors of its spatio-temporally adjacent macroblocks, and then conventional AHS(Adaptive Hexagon Search) is performed if the spatio-temporal motion activity is lower, otherwise, hierarchical hexagon search is performed on a multi-layered hierarchical space constructed by multiple sub-images with low frequency in wavelet transform. In the paper, based on computer simulation results for multiple video sequences with different motion characteristics, the performance of the proposed method was analysed and assessed in terms of the predictive quality and the computational time. Experimental results indicate that the proposed method is both suitable for (quasi-) stationary and large motion searches. The proposed method could keep the merit of the adaptive hexagon search capable of fast estimating motion vectors and also adaptively reduce the local minima occurred in the video sequences with higher spatio-temporal motion activity.

• Journal of Korea Multimedia Society
• /
• v.10 no.11
• /
• pp.1439-1445
• /
• 2007

In this paper, we propose a fast motion estimation algorithm using initial matching errors by sorting square sub-blocks to find complex sub-block area adaptively based on partial calculation of SAD(sum of absolute difference) while keeping the same prediction quality compared with the PDE(partial distortion elimination) algorithm. We reduced unnecessary calculations with square sub-block adaptive matching scan based initial SAD calculation of square sub-block in each matching block. Our algorithm reduces about 45% of computations for block matching error compared with conventional PDE(partial distortion elimination) algorithm without any degradation of prediction quality, and for algorithm will be useful to real-time video coding applications using MPEG-4 AVC or MPEG-2.