Three algorithms for fast long-term memory block matching motion estimation
are proposed. The algorithms are extensions of the fast single-reference s
implex minimisation search (SMS) algorithm. The proposed algorithms represe
nt different degrees of compromise between prediction quality and computati
onal complexity. With a long-term memory of 50 frames, the proposed algorit
hms have a computational complexity comparable to that of single-reference
full-search while still maintaining the prediction gain of long-term memory
motion estimation.