By Topic

Multiscale recursive estimation, data fusion, and regularization

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
$33 $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

3 Author(s)
K. C. Chou ; SRI Int., Menlo Park, CA, USA ; A. S. Willsky ; A. Benveniste

We describe a framework for modeling stochastic phenomena at multiple scales and for their efficient estimation or reconstruction given partial and/or noisy measurements which may also be at several scales. In particular multiscale signal representations lead naturally to pyramidal or tree-like data structures in which each level in the tree corresponds to a particular scale of representation. A class of multiscale dynamic models evolving on dyadic trees is introduced. The main focus of this paper is on the description, analysis, and application of an extremely efficient optimal estimation algorithm for this class of models. This algorithm consists of a fine-to-coarse filtering sweep, followed by a coarse-to-fine smoothing step, corresponding to the dyadic tree generalization of Kalman filtering and Rauch-Tung-Striebel smoothing. The Kalman filtering sweep consists of the recursive application of three steps: a measurement update step, a fine-to-coarse prediction step, and a fusion step. We illustrate the use of our methodology for the fusion of multiresolution data and for the efficient solution of “fractal regularizations” of ill-posed signal and image processing problems encountered

Published in:

IEEE Transactions on Automatic Control  (Volume:39 ,  Issue: 3 )