Abstract

This paper proposes a new recursive implementation of the Gaussian filter. Previous recursive implementations of the Gaussian filter suffer from one or several drawbacks. Some methods require employment of both causal and anti-causal filters. Implementing such filters requires both forward and backward recursions, and thus, significant amounts of memory, in the case of long sequences, to store and combine both recursion results. Moreover, most existing techniques do not ensure that the sum of impulse response weights equals unity, or that the standard deviation of the filter is exactly the desired one. The proposed technique is based on a recursive implementation of cosine-based finite impulse response filters and only requires forward recursions. The sum of filter weights and the standard deviation of the filter are constrained to the desired values during the design process. Experimental results confirm that the proposed filter provides a more suitable tradeoff between computational efficiency and filtering accuracy compared to existing recursive implementations. The performance and advantages of the proposed filter are demonstrated on signal and image processing examples.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.