A new adaptive search strategy for fast block based motion estimation algorithms

Venkatachalapathy, K.; Krishnamoorthy, Rajagopal; Viswanath, K.

doi:10.1016/j.jvcir.2003.08.001

Cited by 6 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…of the neighboring MVs [17], [18] or selecting one of the neighboring MVs according to certain criteria [19]. On some cases, the search window's size, and pattern are redefined accordingly [20]. After finding the AISC, a search algorithm is performed starting at this new search center.…”

Section: Adaptive Search Strategymentioning

confidence: 99%

A Fast Block Matching Algorithm Based on Motion Vector Correlation and Integral Projections

Ghoneim

Tsumura

Nakaguchi

et al. 2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYThe block based motion estimation technique is adopted by various video coding standards to reduce the temporal redundancy in video sequences. The core of that technique is the search algorithm implemented to find the location of the best matched block. Indeed, the full search algorithm is the most straightforward and optimal but computationally demanding search algorithm. Consequently, many fast and suboptimal search algorithms have been proposed. Reduction of the number of location being searched is the approach used to decrease the computational load of full search. In this paper, hybridization between an adaptive search algorithm and the full search algorithm is proposed. The adaptive search algorithm benefits from the correlation within spatial and temporal adjacent blocks. At the same time, a feature domain based matching criteria is used to reduce the complexity resulting from applying the pixel based conventional criteria. It is shown that the proposed algorithm produces good quality performance and requires less computational time compared with popular block matching algorithms.

show abstract

Section: Adaptive Search Strategymentioning

confidence: 99%

A Fast Block Matching Algorithm Based on Motion Vector Correlation and Integral Projections

Ghoneim

Tsumura

Nakaguchi

et al. 2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

show abstract

“…Among these algorithms TSS,NTSS,FSS were part of MPEG 1,Mpeg 2 and UMHEX, PMVFAST and EPZS are part of current video standards (Sarwer and Wu, 2009). Thus it will be more appropriate to compare the results with these algorithms.All these mentioned algorithms are mainly focused on different shapes of search patterns and criteria to select these patterns(K. Venkatachalapathy and Viswanath, 2004). Figure 1 show some of the search patterns taken by UMHEXS algorithm at different stages in the algorithm.…”

Section: Introductionmentioning

confidence: 99%

Random Initial Search Points Prediction for Content Aware Motion Estimation in H.264

More¹,

Deshmukh²,

More³

et al. 2015

Proceedings of the 10th International Conference on Computer Vision Theory and Applications

View full text Add to dashboard Cite

Motion estimation algorithms used in video encoders are based on three important issues: selection of good initial search points, choice of appropriate search pattern and effective early termination criteria at different stages in algorithm.Motion vector prediction is also treated as initial search point prediction, in which possibility of good match block is predicted. Prediction is based on prior data from co-located and/or adjacent macroblocks from reference frame or current video frame respectively.Different search patterns contribute in achieving near accurate motion estimation. Different types of motion in real time videos can be tracked using different types of patterns. Early termination criteria at different stages in algorithm, avoid search at further possible locations which are pre-decided by pattern of search. This in turns reduces computations and motion estimation time.Proposed algorithm is combination of two concepts, content awareness and initial point prediction.Contents of video data is in terms of homogeneity coefficients. Initial search point prediction is used to avoid the search trapping into local minima.The algorithm is implemented on Reference Software of JM18.4 of H.264/AVC revised on 5th May 2011. The results of the implemented algorithm show that the total time taken for encoding and motion estimation time are less as compared with other algorithms for the videos of different resolutions.

show abstract

Motion Analysis with the Radon Transform on Log-Polar Images

Traver

Pla

2007

J Math Imaging Vis

View full text Add to dashboard Cite

Registro de acceso restringido Este recurso no está disponible en acceso abierto por política de la editorial. No obstante, se puede acceder al texto completo desde la Universitat Jaume I o si el usuario cuenta con suscripción. Registre d'accés restringit Aquest recurs no està disponible en accés obert per política de l'editorial. No obstant això, es pot accedir al text complet des de la Universitat Jaume I o si l'usuari compta amb subscripció. Restricted access item This item isn't open access because of publisher's policy. The full--text version is only available from Jaume I University or if the user has a running suscription to the publisher's contents.

show abstract

A new adaptive search strategy for fast block based motion estimation algorithms

Cited by 6 publications

References 14 publications

A Fast Block Matching Algorithm Based on Motion Vector Correlation and Integral Projections

A Fast Block Matching Algorithm Based on Motion Vector Correlation and Integral Projections

Random Initial Search Points Prediction for Content Aware Motion Estimation in H.264

Motion Analysis with the Radon Transform on Log-Polar Images

Contact Info

Product

Resources

About