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.
展开▼
