in a particular direction then there is a high probability that the current macro block will also have a similar motion vector. This algorithm uses the motion vector of the macro block to its immediate left to predict its own motion vector. Adaptive rood pattern search runs as follows: Start with search location at the center (origin) Find the predicted motion vector for the block Set step size S = max (|X|,|Y|), where (X,Y) is the coordinate of predicted motion vector Search for rood pattern distributed points around the origin at step size S Set the point with least weight as origin Search using small diamond search pattern (SDSP) around the new origin Repeat SDSP search until least weighted point is at the center of SDSP Rood pattern search directly puts the search in an area where there is a high probability of finding a good matching block. The main advantage of ARPS over DS is if the predicted motion vector is (0, 0), it does not waste computational time in doing LDSP, but it directly starts using SDSP. Furthermore, if the predicted motion vector is far away from the center, then again ARPS saves on computations by directly jumping to that vicinity and using SDSP, whereas DS takes its time doing LDSP. References External links 1. http://www.mathworks.com/matlabcentral/fileexchange/8761-block-matching-algorithms-for-motion-estimation 2. https://www.ece.cmu.edu/~ee899/project/deepak_mid.htm Film and video technology Video compression