Research Article  Open Access
Alimorad Mahmoudi, "Adaptive Algorithm for Estimation of TwoDimensional Autoregressive Fields from Noisy Observations", International Journal of Stochastic Analysis, vol. 2014, Article ID 247274, 5 pages, 2014. https://doi.org/10.1155/2014/247274
Adaptive Algorithm for Estimation of TwoDimensional Autoregressive Fields from Noisy Observations
Abstract
This paper deals with the problem of twodimensional autoregressive (AR) estimation from noisy observations. The YuleWalker equations are solved using adaptive steepest descent (SD) algorithm. Performance comparisons are made with other existing methods to demonstrate merits of the proposed method.
1. Introduction
The problem of twodimensional (2D) autoregressive modeling is very important in many signal processing applications. This problem has applications in image processing, radar, sonar, and communications. In image processing, it has been applied to image modeling [1], texture analysis [2], and hyperspectral imagery [3]. In radar and sonar, it can be included in direction finding, model based detection, and spectral estimation [4–6]. It also can be applied to fading channel estimation in communications [7].
In noisefree case, 2D AR estimation is investigated in [8–10]. A 2D lattice structure is proposed for 2D AR modeling in [8] which is capable of simultaneously providing all possible types of 2D causal quarterplane (QP) and asymmetric halfplane (ASHP) AR models. Model identification of a noncausal 2D AR process is presented in [9]. An order recursive algorithm is proposed to solve 2D YuleWalker equations. Modeling of 2D AR processes with various regions of support is considered in [10].
The onedimensional AR parameter estimation from noisy observations is well investigated in the literatures (see [11–14]). The literature is insufficient for twodimensional noisy autoregressive fields. In [15], a method based on combination of the YuleWalker equations and third order moment is proposed. In this method, the driving noise process is forced to be nonGaussian. Recently, in [16], combinations of the low order and high order YuleWalker equations are solved as a quadratic eigenvalue problem. This method is an extension of the method proposed by Davila in [11].
In this paper, we propose a YuleWalker based method for the estimation of 2D AR parameters from noisy observations. Due to the observation noise variance, the LeastSquares (LS) estimate of the parameters is biased. We propose an estimation scheme using the additional YuleWalker equation beyond the order of the model for the observation noise variance estimation. Then, by steepest descent (SD) algorithm, we compensate bias from the estimation. Numerical examples are given to show the effectiveness of the proposed estimation method.
2. Problem Formulation
A 2D autoregressive (AR) field is given by where , is the order of field, and is output of the model, and the driving input field, , is a 2D white zeromean stationary field having variance of . In practice, the observed field is given by where is the observation noise of zeromean stationary field having variance of and it is assumed to be uncorrelated with .
The model is assumed causal and stable and with quarterplane (QP) support. The order of model is assumed to be known. Some order selection methods in 2D AR case are presented in [17].
The power spectral density (PSD) corresponding to noiseless 2D AR field in (1) is given by [18] The YuleWalker (YW) equations for noiseless 2D AR field given by (1) are as follows [19]: where is 2D autocorrelation function, is the expectation operator, and is Kronecker delta function, defined by Due to uncorrelatedness of and , we have . So, the autocorrelation function of the observed field is given by Our objective is to estimate for , , from the observations for .
3. The Algorithm
The YW equations in (4) can be written in a matrix form as where , , and are the vectors.
Because is unknown, the first row in (7) is removed and after rearranging the equations in terms of , the YW equations can be rewritten as follows: where is matrix, , and are vectors. Note that is after removing the first element .
Multiplying both sides of (9) by , we obtain If is assumed to be known, we can iteratively estimate using SD algorithm as follows [20]: where is the LeastSquares (LS) estimate of , is the step size parameter, and and can be estimated from the observations. We can also control the stability and rate of convergence of the algorithm by changing . The above equation converges if is selected between zero and where is the minimum eigenvalue of the matrix.
In many signal processing applications, the observation noise variance is unknown, so we must estimate it. In the following subsection, we present a method to estimate the observation noise variance.
3.1. The Observation Noise Variance Estimation Given a
Consider the YW equations for lag ; we have We arrange the equations in (12) in terms of as where is matrix and is vector.
Multiplying both sides of (10) by and using (13), we obtain The LS estimate of can be obtained via where is the Euclidean norm. Now, we can estimate and by an iterative algorithm which is summarized in the following subsection.
3.2. The Proposed Algorithm
The proposed estimation algorithm can be summarized as follows.
Step 1. Estimate the autocorrelations , using data samples as follows [15]:
Step 2. Form , , , and and compute .
Step 3. Set and
Step 4. Set and compute
Step 5. If [13] where is a small positive number, for example, , the convergence is achieved and the iteration process must be terminated; otherwise, go to Step 4.
3.3. Convergence Analysis
The convergence analysis of the proposed algorithm is similar to the method proposed in [21]. The following result discusses the convergence conditions of the proposed algorithm. In this analysis, the observation noise variance is assumed to be known.
Theorem 1. The necessary and sufficient condition for the convergence of the proposed algorithm is to require the step size parameter to satisfy the following condition: where is the minimum eigenvalue of the matrix.
Proof. Defining estimation error matrix , substituting into (11), and using , we obtain
The eigenvalues of are where is between 0 and 1.
If , then . In this case, we have , and their intersection is .
4. Simulation Results
In order to evaluate the performance of the proposed method and to compare with the LeastSquares (LS) method, two examples are presented. In the first example we generate data using a synthetic 2D noisy AR and in the second example we apply the methods for 2D sinusoidal spectral estimation.
Example 1. Consider a synthetic 2D noisy AR model as follows:
where the and are white Gaussian noises which are mutually uncorrelated.
The signal to noise ratio (SNR) is calculated by
where is the variance of the signal . We assume that and is adjusted to produce a value of the SNR. The is assumed to be equal to . The step size, , is set to one.
The methods are compared in terms of normalized root mean squared error (RMSE) which is defined by
where is the estimate of in the th trial and is the total number of trials. The mean number of iterations per test (NIPT) for the proposed method is also presented against the criterion (19) with a choice of .
In this example, we set , SNR = 5 dB, and . Results of simulations are summarized in Table 1. From Table 1, it can be seen that the performance of the proposed method is better than the LS method.

Example 2. Consider 2D sinusoidal signal in the presence of the noise as follows:
where , , rad/sample is a random phase uniformly distributed over , and is zeromean Gaussian noise with variance . Based on linear prediction property of sinusoidal signals, we can model as a 2D AR order with zero input driving noise . Then, we estimate the model parameters and compute the corresponding normalized power spectrum.
In this example, parameter is adjusted to produce SNR equal to −10 dB and . The mean of the spectrum is depicted in Figures 1 and 2 for the proposed and the LS methods, respectively.
It can be seen from figures of the power spectrum that the proposed method can estimate a spectrum sharper than that of the LS method. Note that, in all simulations presented in this section, the convergence of the proposed method was reached usually within a few iterations (NIPT = 6 iterations on average).
5. Conclusion
The twodimensional noisy AR problem is addressed. The YuleWalker equations are solved by using adaptive steepest descent algorithm. The induced bias from the observation noise variance is removed using the YuleWalker equation beyond the order of the model. Simulation results showed that the proposed method can estimate frequency of sinusoidal signals sharper than that of the LS method.
Conflict of Interests
The author declares that there is no conflict of interests regarding the publication of this paper.
References
 X. Zhang and X. Wu, “Image interpolation by adaptive 2D autoregressive modeling and softdecision estimation,” IEEE Transactions on Image Processing, vol. 17, no. 6, pp. 887–896, 2008. View at: Publisher Site  Google Scholar  MathSciNet
 S. Oe, “Texture segmentation method by using twodimensional AR model and Kullback information,” Pattern Recognition, vol. 26, no. 2, pp. 237–244, 1993. View at: Publisher Site  Google Scholar
 L. He, Z. Yu, Z. Gu, and Y. Li, “Longtail distribution based multiscalemultiband autoregressive detection for hyperspectral imagery,” Multidimensional Systems and Signal Processing, vol. 24, no. 1, pp. 65–85, 2013. View at: Publisher Site  Google Scholar  MathSciNet
 R. R. Hansen Jr. and R. Chellappa, “Noncausal 2D spectrum estimation for direction finding,” IEEE Transactions on Information Theory, vol. 36, no. 1, pp. 108–125, 1990. View at: Publisher Site  Google Scholar
 M. Kay, V. Nagesha, and J. Salisbury, “Broadband detection based on twodimensional mixed autoregressive model,” IEEE Transactions on Signal Processing, vol. 41, no. 7, pp. 2413–2428, 1993. View at: Publisher Site  Google Scholar
 S. M. Kay and S. B. Doyle, “Rapid estimation of the rangeDoppler scattering function,” IEEE Transactions on Signal Processing, vol. 51, no. 1, pp. 255–268, 2003. View at: Publisher Site  Google Scholar
 D. Umansky and M. Pätzold, “A twodimensional autoregressive model for MIMO wideband mobile radio channels,” in Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '08), pp. 1–6, IEEE, New Orleans, La, USA, December 2008. View at: Publisher Site  Google Scholar
 A. H. Kayran and E. Camcioglu, “New efficient 2D lattice structures for general autoregressive modeling of random fields,” IEEE Transactions on Signal Processing, vol. 62, no. 6, pp. 1590–1602, 2014. View at: Publisher Site  Google Scholar  MathSciNet
 B. Choi, “Model identification of a noncausal 2D AR process using a causal 2D AR model on the nonsymmetric halfplane,” IEEE Transactions on Signal Processing, vol. 51, no. 5, pp. 1412–1421, 2003. View at: Publisher Site  Google Scholar  MathSciNet
 B. Choi and D. N. Politis, “Modeling 2D AR processes with various regions of support,” IEEE Transactions on Signal Processing, vol. 55, no. 5, pp. 1696–1707, 2007. View at: Publisher Site  Google Scholar  MathSciNet
 C. E. Davila, “A subspace approach to estimation of autoregressive parameters from noisy measurements,” IEEE Transactions on Signal Processing, vol. 46, no. 2, pp. 531–534, 1998. View at: Publisher Site  Google Scholar
 A. Mahmoudi, M. Karimi, and H. Amindavar, “Parameter estimation of autoregressive signals in presence of colored AR(1) noise as a quadratic eigenvalue problem,” Signal Processing, vol. 92, no. 4, pp. 1151–1156, 2012. View at: Publisher Site  Google Scholar
 W. X. Zheng, “Autoregressive parameter estimation from noisy data,” IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, vol. 47, no. 1, pp. 71–75, 2000. View at: Publisher Site  Google Scholar
 A. Mahmoudi and M. Karimi, “Estimation of the parameters of multichannel autoregressive signals from noisy observations,” Signal Processing, vol. 88, no. 11, pp. 2777–2783, 2008. View at: Publisher Site  Google Scholar
 S. Lee and T. Stathaki, “Twodimensional autoregressive modelling using joint second and third order statistics and a weighting scheme,” in Proceedings of the 12th European Signal Processing Conference (EUSIPCO '04), 2004. View at: Google Scholar
 A. Mahmoudi, “Two dimensional autoregressive estimation from noisy observations as a quadratic eigenvalue problem,” Multidimensional Systems and Signal Processing, 2014. View at: Publisher Site  Google Scholar
 B. Aksasse and L. Radouane, “Twodimensional autoregressive (2D AR) model order estimation,” IEEE Transactions on Signal Processing, vol. 47, no. 7, pp. 2072–2077, 1999. View at: Publisher Site  Google Scholar  MathSciNet
 X.D. Zhang and J. Cheng, “High resolution twodimensional ARMA spectral estimation,” IEEE Transactions on Signal Processing, vol. 39, no. 3, pp. 765–770, 1991. View at: Publisher Site  Google Scholar
 S. M. Kay, Modern Spectral Estimation, PrenticeHall, Englewood Cliffs, NJ, USA, 1988.
 S. Haykin, Adaptive Filter Theory, PrenticeHall, Englewood Cliffs, NJ, USA, 2001.
 A. Mahmoudi, “Adaptive algorithm for multichannel autoregressive estimation in spatially correlated noise,” Journal of Stochastics, vol. 2014, Article ID 502406, 7 pages, 2014. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2014 Alimorad Mahmoudi. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.