just answer this question, slide 45 is provided for reference, right click and open image in new tab to make larger.

slide 45 for reference

Q3: On slide 45, go through the complexity analysis and count the number of addition and multiplication required to filter an M-by-N image with a P-by-Q filter (kernel). That is, explain how each step in detail. For a separable filter, why is the complexity O(MN(P+Q)) by explaining 1. it requires MNP multiples and adds for the first step 2. it requires MNQ multiples and adds for the second step Separability - Why is separability useful in practice? - Filtering an M-by-N image with a P-by-Q kernel requires roughly MNPQ multiples and adds. - For a separable filter, it requires - MNP multiples and adds for the first step - MNQ multiples and adds for the second step - MN(P+Q) multiples and adds - For a 9-by-9 filter, a theoretical speed-up of 4.5