Faster serial method for continuously varying Gaussian filters

摘要

A fast method of implementing a recursive IIR filter, by using the data generated by the Thomas Algorithm for processing the first k pixels of an image, where k is a function of the convergence speed of the Gaussian filter is described herein. For all other pixels in the image, each current pixel is a function of that pixel and a fixed fraction where the fixed fraction is the product of the solution to the Gaussian quadratic and the previous pixel.