Search window size decision for motion estimation algorithm in H.264 video coder

Bailo, Gianluca; Bariani, M.; Barbieri, Ivano; Raggio, M.

doi:10.1109/icip.2004.1421337

Cited by 5 publications

(9 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…2. The computational complexity of ME can also be reduced using an adaptable search window size as is proposed in [3] and [10]. Yet another strategy is to reduce the number of macroblock modes I as is done in [14,30] and [31].…”

Section: Search Pattern Algorithms (Reducing S)mentioning

confidence: 99%

“…(1) where the objects have repetitive motion with a period of more than one frame, (2) there are new visible areas of an object and/or uncovered background that are not easy to approximate from a single previous frame, (3) there are sources of noise in the previous frame, (4) the motion vector (MV) of a macroblock is large. In these cases, using multiple reference frames for ME improves the prediction of motion for the current object.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Improved motion estimation time using a combination of dynamic reference frame selection and residue-based mode decision

Park

Capson

2010

SIViP

View full text Add to dashboard Cite

Motion estimation using multiple reference frames is widely used as the basis for recent video coding standards (eg. H.264/AVC) to achieve increased coding efficiency. However, this increases the complexity of the encoding process. In this paper, a new technique for efficient motion estimation is proposed. A combination of multiple reference frame selection and image residue-based mode selection is used to improve motion estimation time. By dynamic selection of an initial reference frame in advance, the number of reference frames to be considered is reduced. In addition, from examination of the residue between the current block and reconstructed blocks in preceding frames, variable block size mode decisions are made. Modified initial motion vector estimation and early stop condition detection are also adopted to speed up the motion estimation procedure. Experimental results compare the performance of the proposed algorithm with a state of the art motion estimation algorithm and demonstrate significantly reduced motion estimation time while maintaining PSNR performance.

show abstract

Section: Search Pattern Algorithms (Reducing S)mentioning

confidence: 99%

mentioning

confidence: 99%

Improved motion estimation time using a combination of dynamic reference frame selection and residue-based mode decision

Park

Capson

2010

SIViP

View full text Add to dashboard Cite

show abstract

“…After some manipulations, was found to be 3.7975, and for interblock encoding, the DCT coefficient is quantized to zero when satisfies , i.e., (14) or (15) Instead of , the ensemble average of DCT coefficients is applied to (13) and the following upper bound for zeroblock detection can be obtained: …”

Section: The Ensemble Averagementioning

confidence: 99%

“…Another approach attempts to describe the characteristics of the current MB from its discrete cosine transform (DCT) [11]. Some other methods use a feature-based approach [12], or variable search window sizes [13] to reduce the computation cost.…”

Section: Introductionmentioning

confidence: 99%

Zero-Block Mode Decision Algorithm for H.264/AVC

Lee

Lin

2009

IEEE Trans. on Image Process.

View full text Add to dashboard Cite

In the previous paper , we proposed a zero-block intermode decision algorithm for H.264 video coding based upon the number of zero-blocks of 4 x 4 DCT coefficients between the current macroblock and the co-located macroblock. The proposed algorithm can achieve significant improvement in computation, but the computation performance is limited for high bit-rate coding. To improve computation efficiency, in this paper, we suggest an enhanced zero-block decision algorithm, which uses an early zero-block detection method to compute the number of zero-blocks instead of direct DCT and quantization (DCT/Q) calculation and incorporates two adequate decision methods into semi-stationary and nonstationary regions of a video sequence. In addition, the zero-block decision algorithm is also applied to the intramode prediction in the P frame. The enhanced zero-block decision algorithm brings out a reduction of average 27% of total encoding time compared to the zero-block decision algorithm.

show abstract

“…Otros autores [Bailo04] proponen aplicar una exploración exhaustiva solo en las secuencias complejas de video y no en todos los cuadros y bloques por igual. Para ello, aproximan el nivel de movimiento con el algoritmo blob-coloring, en orden de decidir el tamaño de la SW para cada MB: los MBs donde se detecte mayor movimiento se procesan con SWs de gran tamaño; los MBs con poco o sin movimiento, se procesan con SW pequeñas.…”

Section: Ajuste Adaptable De Los Rangos De Búsquedaunclassified

Estudio de Arquitecturas VLSI de la etapa de predicción de la compensación de movimiento, para compresión de imágenes y video con Algoritmos full-search. Aplicación al estándar H.264/AVC.

Campos¹

View full text Add to dashboard Cite

Search window size decision for motion estimation algorithm in H.264 video coder

Cited by 5 publications

References 3 publications

Improved motion estimation time using a combination of dynamic reference frame selection and residue-based mode decision

Improved motion estimation time using a combination of dynamic reference frame selection and residue-based mode decision

Zero-Block Mode Decision Algorithm for H.264/AVC

Estudio de Arquitecturas VLSI de la etapa de predicción de la compensación de movimiento, para compresión de imágenes y video con Algoritmos full-search. Aplicación al estándar H.264/AVC.

Contact Info

Product

Resources

About