We were given an input image that contained three slides representing each of the green, blue, and red filter. I used the given code to divide the three filters and started by using the exhaustive search algorithm. In my code, I tried both minimizing the SSD and maximizing the NCC. I found NCC maximization to perform better and continued with those results. The SSD results can be found in my notebook. Furthermore, to improve performance, during maximization of the NCC, I only ran SSD and NCC on the center pixels, not including a window size amount of pixels on each border. This led to optimal results and led to the difference between the NCC and SSD algorithms to be minimal. The runtime for jpg images is almost instantaneous, while the runtime for tiff images is less than a minute. Below are all the images. Notice that we set a window around -20 to 20.
Green: (5,-1) and Red: (12,0)
Green: (-3,1) and Red: (3,0)
Green: (3,2) and Red: (6,0)