Page 223 - Video Coding for Mobile Communications Efficiency, Complexity, and Resilience

200 Chapter 8. The Simplex Minimization Search

QSIF Foreman
34

33

32

PSNR Y (dB) 31

30

29

28
MR-FS
MR-FS/SM S
27
MR-SMS
MR-3DSM
SR-FS
26
1 2 3 4
Frame skip
(a) Prediction quality
QSIF Foreman
7
10

Searched locations/frame 10
6

5
10

MR-FS
MR-FS/SMS
MR-SMS
MR-3DSM
SR-FS
4
10
1 2 3 4
Frame skip
(b) Computational complexity
Figure 8.11: Comparison between di+erent block-matching algorithms when applied to QSIF
FOREMAN with a multiframe memory of M = 50 frames