Description: Match the fast motion estimation algorithm, its computational complexity can be described as: Operational × volume = search block-matching criteria points. The expression can be interpreted in such a way, the fast matching criterion to determine the circumstances, if a match point of the unit operator determine the amount, and then moving moving moving estimate of the volume operator has direct access to the points in the search, that is, depends on the motion estimation search algorithm, to achieve a three-step search method
- [3Ssearch] - Three-step search motion estimation for
- [Traffic_Matrix] - Summary of the estimated traffic matrix,
- [zyh] - Good Book!
- [pimrc05-B] - perform a system-wide characterization o
- [8951245521] - The new three-step search algorithm to c
- [HBMA] - Search method using hierarchical block m
- [tss] - Three Step Search
- [lk] - Lucas – Kanade Motion Estimation using P
- [BasicMotionVectorEstimation] - Block matching motion estimation algorit
File list (Check if you may need any files):
51478222fast_select
...................\bma.m
...................\mse.m
...................\readblock.m
...................\readbuf.m