• 한국정보디스플레이학회:학술대회논문집
• /
• 2008.10a
• /
• pp.737-740
• /
• 2008

Block-matching motion estimation plays an important role in video coding. In this paper, we propose an Efficient Search Algorithm for Fast Motion Estimation. The proposed algorithm detects motion variation for reducing computational complexity before determining motion vector. Experimental results show that the proposed algorithm has good performance than conventional algorithms through quantitative evaluation.

• Journal of Korea Multimedia Society
• /
• v.13 no.7
• /
• pp.991-999
• /
• 2010

In this paper, we propose a fast motion estimation algorithm for video encoding. Conventional fast motion estimation algorithms have a serious problem of low prediction quality in some frames. However, full search based fast algorithms have low computational reduction ratio. In the paper, we propose an algorithm that significantly reduces unnecessary computations, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution probability of motion vectors and adaptive search patterns and block matching criteria. By taking different search patterns and error criteria of block matching according to distribution probability of motion vectors, we can reduces only unnecessary computations efficiently. Our algorithm takes only 20~30% in computational amount and has decreased prediction quality about 0~0.02dB compared with the fast full search of the H.264 reference software. Our algorithm will be useful to real-time video coding applications using MPEG-2 or MPEG-4 AVC standards.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.1
• /
• pp.43-49
• /
• 2001

EVRC (Enhanced Variable Rate Codec) has been adopted as a standard coder for the CDMA digital cellular system in North America and Korea, and known to provide good call quality at 8kbps. In this paper, fast implementation algorithms for EVRC encoder are proposed. The proposed algorithms are based on both efficient pitch detection scheme and fast fixed codebook search algorithm. In the codebook search, computational complexity is reduced down to 70％ of the original EVRC by limiting the number of pulse position combination and by using a truncated impulse response. The proposed algorithms enable us to implement the EVRC with much smaller computational works. Also, informal subjective tests confirmed that the difference in the speech quality between the original EVRC and the proposed method was indistinguishable.

• Proceedings of the KIEE Conference
• /
• 2005.10b
• /
• pp.529-531
• /
• 2005

A block-based fast motion estimation algorithm is proposed in this paper to perform motion estimation based on the efficiently reduced search ranges in MPEG-4(ERS). This algorithm divides the search areas into several small search areas and the candidate small search area that has the lowest average of sum norm difference between current macroblock and candidate macroblock is chosen to perform block motion estimation using the Nobel Successive Elimination Algorithm (NSEA). Experimental results of the proposed algorithm show that the averaging PSNR improvement is better maximum 0.125 dB than other tested algorithms and bit saving effect is maximum 20kbps for some tested sequences in low-bit rate circumstance.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.40 no.2
• /
• pp.20-28
• /
• 2003

Recently we need a faster and more accurate motion vector search algorithm for ASIC(Application Specific IC) or small systems. Block motion estimation using Full Search(FS) algorithm provides the best visual quality and PSNR, but it requires intensive computations. The previously proposed fast algorithms reduced the number of computations by limiting the number of searching locations. This is accomplished at the expense of less accuracy of motion estimation and gives rise to an appreciably higher SAD(Sum of Absolute Difference) for motion compensated images. In this paper we exploit the spatial correlation of motion vectors and present a fast motion estimation scheme which uses the predicted motion vector(PMV). The PMV scheme is more clear and simpler than the previously proposed algorithms which also use adjacent motion vectors. Simulation results with standard video sequences show that the PMV scheme is faster and more accurate than other algorithms such as Nearest-Neighbors Search(NNS) algorithm.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.885-888
• /
• 2000

Among the previous searching methods, there are the typical methods such as full search and three-step search, etc. Block motion estimation using exhaustive search is too computationally intensive. To apply in practice, recently proposed fast algorithms have been focused on reducing the computational complexity by limiting the number of searching points. According to the reduction of searching points, the quality performance is aggravated in those algorithms. In this paper, We present a fast and efficient search algorithm for block motion estimation that produces better quality performance and less computational time compared with a three-step search (TSS). Previously the proposed Two Step Search Algorithm (TWSS) by Fang-Hsuan Cheng and San-Nan sun is based on the ideas of dithering pattern for pixel decimation using a part of a block pixels for BMA (Block Matching Algorithm) and multi-candidate to compensate quality performance with several locations. This method has good quality performance at slow moving images, but has bad quality performance at fast moving images. To resolve this problem, the proposed algorithm in this paper considers spatial and temporal correlation using neighbor and previous blocks to improve quality performance. This performance uses neighbor motion vectors and previous motion vectors in addition, thus it needs more searching points. To compensate this weakness, the proposed algorithm uses statistical character of dithering matrix. The proposed algorithm is superior to TWSS in quality performance and has similar computational complexity

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.8
• /
• pp.1531-1536
• /
• 2016

In this paper, we propose a fast motion estimation algorithm which is important in performance of video encoding. Even though so many fast algorithms for motion estimation have been published due to its tremendous computational amount of for full search algorithm, efforts for reducing computations in motion estimation still remain. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality the same as that of the full search. The proposed algorithm does not calculate block matching error for each candidate at once to find motion vectors but divides the calculation procedure into several steps and calculates partial sum of block errors. By doing that, we can estimate the minimum error point early and get the enhancement of calculation speed by reducing unnecessary computations. The proposed algorithm uses smaller computations than conventional fast search algorithms with the same prediction quality as full search.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.4
• /
• pp.372-378
• /
• 2010

This paper propose the fast motion estimation algorithm with adaptive search range adjustment using motion activities of temporal and spatial neighbor blocks. The existing fast motion estimation algorithms with adaptive search range adjustment use the maximum motion vector of all blocks in the reference frame. So these algorithms may not control a optimum search range for slow moving block in current frame. The proposed algorithm use the maximum motion vector of neighbor blocks in the reference frame to control a optimum search range for slow moving block. So the proposed algorithm can reduce computation time for motion estimation. The experiment results show that the proposed algorithm can reduce the number of search points about 15% more than Simple Dynamic Search Range(SDSR) algorithm while maintaining almost the same bit-rate and motion estimation error.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.811-812
• /
• 2008

In this paper, a modified cross search algorithm for fast block matching motion estimation is proposed. Various Motion Estimation (ME) algorithms have been proposed since ME requires large computational complexity. The proposed algorithm employs Modified Cross Search Pattern (MCSP) to search the motion vector. Efficient compression can be achieved since Modified Cross Search Algorithm (MCSA) simplifies the search pattern to reduce the computational complexity. The experimental results show that proposed algorithm reduces the search points up to 29% compared to conventional methods.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.14 no.4
• /
• pp.418-423
• /
• 2004

The motion estimation algorithm based block matching is a widely used in the international standards related to video compression, such as the MPEG series and H.26x series. Full search algorithm(FA) ones of this block matching algorithms is usually impractical because of the large number of computations required for large search region. Fast search algorithms and conventional binary block matching algorithms reduce computational complexity and data processing time but this algorithms have disadvantages that is less performance than full search algorithm. This paper presents new Boolean matching algorithm, called BCBM(Bit Converted Boolean Matching). Proposed algorithm has performance closed to the FA by Boolean only block matching that may be very efficiently implemented in hardware for real time video communication. Simulation results show that the PSNR of the proposed algorithm is about 0.08㏈ loss than FA but is about 0.96∼2.02㏈ gain than fast search algorithm and conventional Boolean matching algorithm.