๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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


Content-aware full search scheme for mot
โœ Shih-Yu Huang ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 147 KB

## 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

Adaptive computation-aware scheme for so
โœ Shih-Yu Huang ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 925 KB

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

Fast GLS algorithm for parameter estimat
โœ M.S. Ahmed ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 491 KB

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

A fast algorithm for vertex estimation
โœ E. Calligarich; R. Dolfini; M. Genoni; A. Rotondi ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 516 KB
A Fast Non-Parametric Density Estimation
โœ EฤŸecioฤŸlu, ร–mer ;Srinivasan, Ashok ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 152 KB ๐Ÿ‘ 1 views

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

Algorithms for Fast Convolutions on Moti
โœ Alexander B Kyatkin; Gregory S Chirikjian ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 238 KB

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