An Enhanced Adaptive Rood Pattern Search Algorithm for Fast Block-Matching Motion Estimation

Hui, Zhao; Yu, Xinbo; Sun, Jiahong; Sun, Chang; Cong, Hao-zhe

doi:10.1109/cisp.2008.498

Cited by 13 publications

(7 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…ARPS algorithm [98] based MPEG-4 Verification Model (VM) [7] showed a speed 2-3 times faster than that of the DS and maintained a fairly similar performance [138].…”

Section: Adaptive Rood Pattern Search (Arps) Algorithmmentioning

confidence: 99%

A survey on video compression fast block matching algorithms

Hussain

Ahmed

2019

Neurocomputing

View full text Add to dashboard Cite

Video compression is the process of reducing the amount of data required to represent digital video while preserving an acceptable video quality. Recent studies on video compression have focused on multimedia transmission, videophones, teleconferencing, high definition television, CD-ROM storage, etc. The idea of compression techniques is to remove the redundant information that exists in the video sequences. Motion compensation predictive coding is the main coding tool for removing temporal redundancy of video sequences and it typically accounts for 50-80% of video encoding complexity. This technique has been adopted by all of the existing

show abstract

“…ARPS algorithm [98] based MPEG-4 Verification Model (VM) [7] showed a speed 2-3 times faster than that of the DS and maintained a fairly similar performance [138].…”

Section: Adaptive Rood Pattern Search (Arps) Algorithmmentioning

confidence: 99%

A survey on video compression fast block matching algorithms

Hussain

Ahmed

2019

Neurocomputing

View full text Add to dashboard Cite

show abstract

“…The ARPS algorithm [Nie and Ma, 2002] based on the MPEG-4 Verification Model , 1999] showed a speed 2-3 times faster and maintained a fairly similar performance than that of the DS [Zhao et al, 2008]. ARPS uses a predictive search technique to form an initial estimate of finding the global minimum point.…”

Section: Adaptive Rood Pattern Search (Arps) Algorithmmentioning

confidence: 99%

Enhanced Computation Time for Fast Block Matching Algorithm

Ahmed

Hussain

Al‐Jumeily

2011

2011 Developments in E-Systems Engineering

View full text Add to dashboard Cite

i ACKNOWLEDGMENTSMy thanks go firstly, as it should always be, to Allah who gave me the energy, health, and courage to spend a lot of determination and time until I completed this work.My most sincere gratitude and appreciation to my supervisor Dr Abir Hussain for all her patience, valuable advice, discussions, convincing arguments and more during the life of this thesis, I wish her all the best for the future. I also owe a great debt to Dr. Dhiya Al-Jumeily for his support, advice and encouragement from the beginning until now and I would like to thank him for his constructive comments on my thesis. Motion compensated predictive coding is the main coding tool for removing temporal redundancy of video sequences and it typically accounts for 50-80% of the video encoding complexity. This technique has been adopted by all of the existing international video coding standards. It assumes that the current frame can be locally modelled as a translation of the reference frames. The practical and widely method used to carry out motion compensated prediction is block matching algorithm. In this method, video frames are divided into a set of non-overlapped macroblocks; each target macroblock of the current frame is compared with the search area in the reference frame in order to find the best matching macroblock. This will carry out displacement vectors that stipulate the movement of the macroblocks from one location to another in the reference frame. Checking all these locations is called full Search, which provides the best result. However, this algorithm suffers from long computational time, which necessitates improvement. Several methods of Fast Block Matching algorithm were developed to reduce the computation complexity.This thesis focuses on two classifications: the first is called the lossless block matching algorithm process, in which the computational time required to determine the matching macroblock of the full search is decreased while the resolution of the predicted frames is the same as for the full search. The second is called the lossy block matching algorithm process, which reduces the computational complexity effectively but the search result's quality is not the same as for the full search.

show abstract

“…Estimate the MVs (A, B and C and D as shown in Figure 1) for both forward and backward path using ARPS [10].…”

Section: ) Frame Structure Definitionmentioning

confidence: 99%

“…2) MV estimation: uses ARPS [10] since it exploits the fact motion is generally coherent, so the MV of an adjacent block can predict the direction of the current block. A 4 x 4 pixel block is employed for ARPS in HOPTTI.…”

Section: ) Frame Structure Definitionmentioning

confidence: 99%

“…Instead of tracking every pixel however, 4 x 4 pixel blocks are tracked so a block-based motion field is sampled using block-based MV estimation to reduce the computational overheads in terms of the number of MV and the search method. For instance, the adaptive rood pattern search (ARPS) algorithm [10] used by HOPTTI reduces the number of MV search points to about 9 compared with 255 for a full search. By using a higher-order motion trajectory models, HOPTTI provides superior SI quality in terms of the average peak signal-to-noise ratio (PSNR) compared with existing LMCTI techniques, with for certain sequences, an improvement of over 8dB achieved when using cubic polynomials instead of a linear model.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Wyner-Ziv side information generation using a higher order piecewise trajectory temporal interpolation algorithm

2011

View full text Add to dashboard Cite

Abstract-Distributed video coding (DVC) reverses the traditional coding paradigm of complex encoders allied with basic decoding, to one where the computational cost is largely incurred by the decoder. This enables low-cost, resource-poor sensors to be used at the transmitter in various applications including multi-sensor surveillance. A key constraint governing DVC performance is the quality of side information (SI), a coarse representation of original video frames which are not available at the decoder. Techniques to generate SI have generally been based on linear temporal interpolation, though these do not always produce satisfactory SI quality especially in sequences exhibiting asymmetric (non-linear) motion. This paper presents a higherorder piecewise trajectory temporal interpolation (HOPTTI) algorithm for SI generation that quantitatively and perceptually affords better SI quality in comparison to existing temporal interpolation-based approaches.

show abstract

An Enhanced Adaptive Rood Pattern Search Algorithm for Fast Block-Matching Motion Estimation

Cited by 13 publications

References 5 publications

A survey on video compression fast block matching algorithms

A survey on video compression fast block matching algorithms

Enhanced Computation Time for Fast Block Matching Algorithm

Wyner-Ziv side information generation using a higher order piecewise trajectory temporal interpolation algorithm

Contact Info

Product

Resources

About