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

Optimum Recursive Filtering of Noisy Two-Dimensional Data with Sequential Parameter Identification

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)
Yum, Young-Ho ; Department of Electrical Sciences, Korea Advanced Institute of Science and Technology, Seoul, Korea. ; Park, Song B.

A two-dimensional recursive estimation algorithm based on the asymmetric half-plane model is described for the problem of MMSE (minimum mean-square error) filtering. The optimum filtering problem is solved by formulating the asymmetric half-plane ARMA (autoregressive moving average) model for two-dimensional data. The sequential parameter identification from the noisy two-dimensional data is also discussed, utilizing the stochastic approximation. Experiments were performed for real image data, combining the proposed parameter identification and estimation algorithms. The results show that this method gives considerable improvement in SNR.

Published in:

Pattern Analysis and Machine Intelligence, IEEE Transactions on  (Volume:PAMI-5 ,  Issue: 3 )

Date of Publication:

May 1983

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.