𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two-dimensional adaptive filters based on the one-dimensional recursive least squares algorithm

✍ Scribed by Mitsuji Muneyasu; Eiji Uemoto; Takao Hinamoto


Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
645 KB
Volume
79
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.

✦ Synopsis


This paper proposes a method for realizing twodimensional (2-D) adaptive filters by applying a onedimensional (1-D) recursive least squares (RLS) algorithm. First, by applying a 1-D RLS algorithm along horimntal and vertical directions, a novel 2-D adaptive algorithm is developed. It is shown that the amount of calculations in the proposed algorithm is less than that in the existing 2-D RLS algorithm. Moreover, the convergence properties of the proposed algorithm and its relation to the conventional 2-D RLS algorithm are investigated. A method for accelerating the rate of convergence of the algorithm using Q priori estimation error also is described.

The proposed filter has good performance in nonstationary processes and the accuracy of convergence is better than that in the existing 2-D adaptive filters based on the least mean square (LMS) algorithm. Therefore, the proposed filter is suitable for processing an image with strongly nonstationary characteristics. Finally, the utility of the proposed filter is illustrated by applying it to 2-D system identification under a nonstationary environment as well as noise reduction of an image.


πŸ“œ SIMILAR VOLUMES


On The Numerical Solution of One-Dimensi
✍ G. Beckett; J.A. Mackenzie; A. Ramage; D.M. Sloan πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 149 KB

Numerical experiments are described that illustrate some important features of the performance of moving mesh methods for solving one-dimensional partial differential equations (PDEs). The particular method considered here is an adaptive finite difference method based on the equidistribution of a mo

Lossless scalable coding of still images
✍ Masahiro Iwahashi; Shinji Fukuma; Noriyoshi Kambayashi πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 442 KB

When high-definition images such as medical images and art are compressed, it is desirable that the quality of the original image be maintained at the time of reconstruction. Also, if there is a scalable functionality such that the summary of the image information can be understood even if a part of

Application of the Filter Diagonalizatio
✍ Vladimir A. Mandelshtam; Howard S. Taylor; A.J. Shaka πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 152 KB

A new non-Fourier data processing algorithm, the filter diagonalization method (FDM), is presented and applied to phase-sensitive 1D and 2D NMR spectra. FDM extracts parameters (peak positions, linewidths, amplitudes, and phases) directly from the time-domain data by fitting the data to a sum of dam

Algorithm for finding one of the largest
✍ Sumio Masuda; Hiroyuki Yoshioka; Eiichi Tanaka πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 176 KB πŸ‘ 1 views

Given two connected graphs G a = (V a , E a ) and G b = (V b , E b ) with three-dimensional structures. Let n a = |V a |, m a = |E a |, n b = |V b |, and m b = |E b |. Let the maxi- mum order of a vertex in G a (G b ) be l a (l b ). Initially this paper offers a method to find a largest common subgr