Abstract
A recursive algorithm has been developed for LoG filtering. We use an analytic method to obtain the z-transform of LoG function in a rational function form. The structure of the recursive filters is defined by the order of rational functions. The computational complexity of recursive filtering depends on the number of poles and zeros of the transfer function, i.e., on the structure of the recursive filter. It is independent of the size of the filter, and thus has a substantial saving in computation. The algorithm gives a constant computation complexity per pixel. Various images have been tested. A general method of designing high order recursive filters is also given.
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 callDisclaimer: 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.
