## Abstract Taking into consideration computational complexity and design regularity, this article proposes a contentโaware full search (CAFS) block matching scheme for motion estimation. Full search (FS) is widely employed in hardware design of block matching because of its regular data flow. But
Content-Aware Fast Motion Estimation Algorithm
โ Scribed by Yi-Wen Chen; Ming-Ho Hsiao; Hua-Tsung Chen; Chi-Yu Liu; Suh-Yin Lee
- Publisher
- Elsevier Science
- Year
- 2008
- Tongue
- English
- Weight
- 620 KB
- Volume
- 19
- Category
- Article
- ISSN
- 1047-3203
No coin nor oath required. For personal study only.
โฆ Synopsis
In this paper, we propose the Content-Aware Fast Motion Estimation Algorithm (CAFME) that can reduce computation complexity of motion estimation (ME) in H.264/AVC while maintaining almost the same coding efficiency. Motion estimation can be divided into two phases: searching phase and matching phase. In searching phase, we propose the Simple Dynamic Search Range Algorithm (SDSR) based on video characteristics to reduce the number of search points (SP). In matching phase, we integrate the Successive Elimination Algorithm (SEA) and the integral frame to develop a new SEA for H.264/AVC video compression standard, called Successive Elimination Algorithm with Integral Frame (SEAIF). Besides, we also propose the Early Termination Algorithm (ETA) to early terminate the motion estimation of current block.
We implement the proposed algorithm in the reference software JM9.4 of H.264/AVC and the experimental results show that our proposed algorithm can reduce the number of search points about 93.1%, encoding time about 42%, while maintaining almost the same bitrate and PSNR.
๐ SIMILAR VOLUMES
The progress in computer processing power makes the use of a software codec (encoder and decoder) a feasible solution in many real-time video applications. The efficient distribution of available processing power to frames and blocks by a software codec resulting in higher output quality comprises t
Akstraet--A computationally efficient off-line algorithm for estimating the parameters of a linear discrete-time SISO system is presented. The algorithm is based on the generalized leastsquares (GLS) principle. It is essentially a correlation version of the GLS method that (1) eliminates all the red
Non-parametric density estimation is the problem of approximating the values of a probability density function, given samples from the associated distribution. Non-parametric estimation ยฎnds applications in discriminant analysis, cluster analysis, and ยฏow calculations based on Smoothed Particle Hydr
In this paper we apply techniques from noncommutative harmonic analysis to the development of fast algorithms for the computation of convolution integrals on motion groups. In particular, we focus on the group of rigid-body motions in 3-space, which is denoted here as SE(3). The general theory of ir