Cart (Loading....) | Create Account
Close category search window
 

A fast algorithm for linear estimation of two- dimensional isotropic random fields

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)

The problem considered involves estimating a two-dimensional isotropic random field given noisy observations of this field over a disk of finite radius. By expanding the field and observations in Fourier series, and exploiting the covariance structure of the resulting Fourier coefficient processes, recursions are obtained for efficiently constructing the linear least-squares estimate of the field as the radius of the observation disk increases. These recursions are similar to the Levinson equations of one-dimensional linear prediction. In the spectral domain they take the form of Schrödinger equations, which are used to give an inverse spectral interpretation of our estimation procedure.

Published in:

Information Theory, IEEE Transactions on  (Volume:31 ,  Issue: 5 )

Date of Publication:

Sep 1985

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.