Results 1 
6 of
6
Multiresolution markov models for signal and image processing
 Proceedings of the IEEE
, 2002
"... This paper reviews a significant component of the rich field of statistical multiresolution (MR) modeling and processing. These MR methods have found application and permeated the literature of a widely scattered set of disciplines, and one of our principal objectives is to present a single, coheren ..."
Abstract

Cited by 154 (19 self)
 Add to MetaCart
(Show Context)
This paper reviews a significant component of the rich field of statistical multiresolution (MR) modeling and processing. These MR methods have found application and permeated the literature of a widely scattered set of disciplines, and one of our principal objectives is to present a single, coherent picture of this framework. A second goal is to describe how this topic fits into the even larger field of MR methods and concepts–in particular making ties to topics such as wavelets and multigrid methods. A third is to provide several alternate viewpoints for this body of work, as the methods and concepts we describe intersect with a number of other fields. The principle focus of our presentation is the class of MR Markov processes defined on pyramidally organized trees. The attractiveness of these models stems from both the very efficient algorithms they admit and their expressive power and broad applicability. We show how a variety of methods and models relate to this framework including models for selfsimilar and 1/f processes. We also illustrate how these methods have been used in practice. We discuss the construction of MR models on trees and show how questions that arise in this context make contact with wavelets, state space modeling of time series, system and parameter identification, and hidden
Efficient multiscale regularization with applications to the computation of optical flow
 IEEE Trans. Image Process
, 1994
"... AbsfruetA new approach to regularization methods for image processing is introduced and developed using as a vehicle the problem of computing dense optical flow fields in an image sequence. Standard formulations of this problem require the computationally intensive solution of an elliptic partial d ..."
Abstract

Cited by 106 (36 self)
 Add to MetaCart
AbsfruetA new approach to regularization methods for image processing is introduced and developed using as a vehicle the problem of computing dense optical flow fields in an image sequence. Standard formulations of this problem require the computationally intensive solution of an elliptic partial differential equation that arises from the often used “smoothness constraint” ’yl”. regularization. The interpretation of the smoothness constraint is utilized as a “fractal prior ” to motivate regularization based on a recently introduced class of multiscale stochastic models. The solution of the new problem formulation is computed with an efficient multiscale algorithm. Experiments on several image sequences demonstrate the substantial computational savings that can be achieved due to the fact that the algorithm is noniterative and in fact has a per pixel computational complexity that is independent of image size. The new approach also has a number of other important advantages. Specifically, multiresolution flow field estimates are available, allowing great flexibility in dealing with the tradeoff between resolution and accuracy. Multiscale error covariance information is also available, which is of considerable use in assessing the accuracy of the estimates. In particular, these error statistics can be used as the basis for a rational procedure for determining the spatiallyvarying optimal reconstruction resolution. Furthermore, if there are compelling reasons to insist upon a standard smoothness constraint, our algorithm provides an excellent initialization for the iterative algorithms associated with the smoothness constraint problem formulation. Finally, the usefulness of our approach should extend to a wide variety of illposed inverse problems in which variational techniques seeking a “smooth ” solution are generally Used. I.
A Stochastic Modeling Approach to Multiscale Signal Processing
, 1991
"... In recent years there has been much interest in multiscale signal analysis, a large part of which is due to the recent flurry of research in the study of the wavelet transform. Though multiscale analysis seems like a natural enough paradigm in which to solve various signal processing problems, there ..."
Abstract

Cited by 38 (4 self)
 Add to MetaCart
In recent years there has been much interest in multiscale signal analysis, a large part of which is due to the recent flurry of research in the study of the wavelet transform. Though multiscale analysis seems like a natural enough paradigm in which to solve various signal processing problems, there has been no satisfactory statistical theory to provide a means of formulating optimal estimation and identification problems and assessing the performance of solutions. This thesis provides a statistical framework for multiscale signal processing based on stochastic models motivated by the wavelet transform. We first consider models defined on lattices which are naturally motivated by the synthesis equation of the wavelet transform. These are statespace models in which the points at each level of the lattice represent the state of the process at that level or scale. Our models can be used to describe processes which possess selfsimilar characteristics and in fact they model rather well 1/ftype processes as well as, perhaps surprisingly, other wellstudied processes. We formulate the smoothing problem for our class of models and develop fast algorithms for computing the optimal
Image Processing with Multiscale Stochastic Models
, 1993
"... In this thesis, we develop image processing algorithms and applications for a particular class of multiscale stochastic models. First, we provide background on the model class, including a discussion of its relationship to wavelet transforms and the details of a twosweep algorithm for estimation. A ..."
Abstract

Cited by 34 (4 self)
 Add to MetaCart
In this thesis, we develop image processing algorithms and applications for a particular class of multiscale stochastic models. First, we provide background on the model class, including a discussion of its relationship to wavelet transforms and the details of a twosweep algorithm for estimation. A multiscale model for the error process associated with this algorithm is derived. Next, we illustrate how the multiscale models can be used in the context of regularizing illposed inverse problems and demonstrate the substantial computational savings that such an approach offers. Several novel features of the approach are developed including a technique for choosing the optimal resolution at which to recover the object of interest. Next, we show that this class of models contains other widely used classes of statistical models including 1D Markov processes and 2D Markov random fields, and we propose a class of multiscale models for approximately representing Gaussian Markov random fields...
Signal Processing
, 1991
"... In recent years there has been much interest in multiscale signal analysis, a large part of which is due to the recent flurry of research in the study of the wavelet transform. Though multiscale analysis seems like a natural enough paradigm in which to solve various signal processing problems, there ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In recent years there has been much interest in multiscale signal analysis, a large part of which is due to the recent flurry of research in the study of the wavelet transform. Though multiscale analysis seems like a natural enough paradigm in which to solve various signal processing problems, there has been no satisfactory statistical theory to provide a means of formulating optimal estimation and identification problems and assessing the performance of solutions. This thesis provides a statistical framework for multiscale signal processing based on stochastic models motivated by the wavelet transform. We first consider models defined on lattices which are naturally motivated by the synthesis equation of the wavelet transform. These are statespace models in which the points at each level of the lattice represent the state of the process at that level or scale. Our models can be used to describe processes which possess selfsimilar characteristics and in fact they model rather well 1/ftype processes as well as, perhaps surprisingly, other wellstudied processes. We formulate the smoothing problem for our class of models and develop fast algorithms for computing the optimal