Bidirectional Search(implementation in MATLAB required) For video compression, we can categorize the search into: Backward search: search in previous N frames. Forward search: search in subsequent N frames. Bidirectional search: search in both previous and subsequent frames. For bidirectional search, provide the computational complexity per pixel for normalized cross-correlation and the basic block search assuming: The ground truth block is of size B1 rows and B2 columns. Bidirectional search looks into the previous N frames and the following N frames. Full search and subsabmpled search use Q and h as defined previously. the FFT2 is used for computing 2D cross-correlations. You need to study the code to establish the sizes. You can also study the lecture notes by Boviks notes given on slide 348 of the Digital Image Processing notes. Please note that the 2D FFT2 requires O(N 2 log2(N)) flops where N N is the size of the final zero-padded image.