Abstract
The design of two-dimensional (2-D) recursive digital filters in the spatial domain is investigated. Two algorithms are proposed for this purpose, namely, a modified version of the Newton-Raphson (MNR) method, and the Broyden-Fletcher-Goldfarb-Shanno (BFGS) algorithm. Both of these methods are shown to outperform the Davidson-Fletcher-Powell (DFP) algorithm in terms of efficiency, when used for filter design. Comparison shows that the MNR is more efficient than the BFGS except for very-low-order filters, where the BFGS performs slightly better. >
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.
