Results 1  10
of
19
A Multiscale Random Field Model for Bayesian Image Segmentation
, 1996
"... Many approaches to Bayesian image segmentation have used maximum a posteriori (MAP) estimation in conjunction with Markov random fields (MRF). While this approach performs well, it has a number of disadvantages. In particular, exact MAP estimates cannot be computed, approximate MAP estimates are com ..."
Abstract

Cited by 233 (18 self)
 Add to MetaCart
Many approaches to Bayesian image segmentation have used maximum a posteriori (MAP) estimation in conjunction with Markov random fields (MRF). While this approach performs well, it has a number of disadvantages. In particular, exact MAP estimates cannot be computed, approximate MAP estimates are computationally expensive to compute, and unsupervised parameter estimation of the MRF is difficult. In this paper, we propose a new approach to Bayesian image segmentation which directly addresses these problems. The new method replaces the MRF model with a novel multiscale random field (MSRF), and replaces the MAP estimator with a sequential MAP (SMAP) estimator derived from a novel estimation criteria. Together, the proposed estimator and model result in a segmentation algorithm which is not iterative and can be computed in time proportional to MN where M is the number of classes and N is the number of pixels. We also develop a computationally effcient method for unsupervised estimation of m...
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 98 (33 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.
Modeling and estimation of multiresolution stochastic processes
 IEEE TRANS. ON INFORMATION THEORY
, 1992
"... An overview is provided of the several components of a research effort aimed at the development of a theory of multiresolution stochastic modeling and associated techniques for optimal multiscale statistical signal and image processing. As described, a natural framework for developing such a theory ..."
Abstract

Cited by 94 (17 self)
 Add to MetaCart
An overview is provided of the several components of a research effort aimed at the development of a theory of multiresolution stochastic modeling and associated techniques for optimal multiscale statistical signal and image processing. As described, a natural framework for developing such a theory is the study of stochastic processes indexed by nodes on lattices or trees in which different depths in the tree or lattice correspond to different spatial scales in representing a signal or image. In particular, it will be seen how the wavelet transform directly suggests such a modeling paradigm. This perspective then leads directly to the investigation of several classes of dynamic models and related notions of “ multiscale stationarity ” in which scale plays the role of a timelike variable. Focus is primarily on the investigation of models on homogenous trees. In particular, the elements of a dynamic system theory on trees are described
Multiscale Representations of Markov Random Fields
 IEEE TRANSACTIONS ON SIGNAL PROCESSING. VOL 41. NO 12. DECEMBER 1993
, 1993
"... Recently, a framework for multiscale stochastic modeling was introduced based on coarsetofine scalerecursive dynamics defined on trees. This model class has some attractive characteristics which lead to extremely efficient, statistically optimal signal and image processing algorithms. In this pap ..."
Abstract

Cited by 85 (27 self)
 Add to MetaCart
Recently, a framework for multiscale stochastic modeling was introduced based on coarsetofine scalerecursive dynamics defined on trees. This model class has some attractive characteristics which lead to extremely efficient, statistically optimal signal and image processing algorithms. In this paper, we show that this model class is also quite rich. In particular, we describe how 1D Markov processes and 2D Markov random fields (MRF’s) can be represented within this framework. The recursive structure of 1D Markov processes makes them simple to analyze, and generally leads to computationally efficient algorithms for statistical inference. On the other hand, 2D MRF’s are well known to be very difficult to analyze due to their noncausal structure, and thus their use typically leads to computationally intensive algorithms for smoothing and parameter identification. In contrast, our multiscale representations are based on scalerecursive models and thus lead naturally to scalerecursive algorithms, which can be substantially more efficient computationally than those associated with MRF models. In 1D, the multiscale representation is a generalization of the midpoint deflection construction of Brownian motion. The representation of 2D MRF’s is based on a further generalization to a “midline ” deflection construction. The exact representations of 2D MRF’s are used to motivate a class of multiscale approximate MRF models based on onedimensional wavelet transforms. We demonstrate the use of these latter models in the context of texture representation and, in particular, we show how they can be used as approximations for or alternatives to wellknown MRF texture models.
Distributed Representation and Analysis of Visual Motion
, 1993
"... This thesis describes some new approaches to the representation and analysis of visual motion, as perceived by a biological or machine visual system. We begin by discussing the computation of image motion fields, the projection of motion in the threedimensional world onto the twodimensional image ..."
Abstract

Cited by 61 (4 self)
 Add to MetaCart
This thesis describes some new approaches to the representation and analysis of visual motion, as perceived by a biological or machine visual system. We begin by discussing the computation of image motion fields, the projection of motion in the threedimensional world onto the twodimensional image plane. This computation is notoriously difficult, and there are a wide variety of approaches that have been developed for use in image processing, machine vision, and biological modeling. We show that a large number of the basic techniques are quite similar in nature, differing primarily in conceptual motivation, and that they each fail to handle a set of situations that occur commonly in natural scenery. The central theme of the thesis is that the failure of these algorithms is due primarily to the use of vector fields as a representation for visual motion. We argue that the translational vector field representation is inherently impoverished and errorprone. Furthermore, there is evidence that a ...
Likelihood calculation for a class of multiscale stochastic models, with application to texture discrimination
 IEEE Transactions on Image Processing
, 1995
"... Abstruct A class of multiscale stochastic models based on scalerecursive dynamics on trees has recently been introduced. Theoretical and experimental results have shown that these models provide an extremely rich framework for representing both processes which are intrinsically multiscale, e.g., l ..."
Abstract

Cited by 58 (20 self)
 Add to MetaCart
Abstruct A class of multiscale stochastic models based on scalerecursive dynamics on trees has recently been introduced. Theoretical and experimental results have shown that these models provide an extremely rich framework for representing both processes which are intrinsically multiscale, e.g., llf processes, as well as 1D Markov processes and 2D Markov random fields. Moreover, efficient optimal estimation algorithms have been developed for these models by exploiting their scalerecursive structure. In this paper, we exploit this structure in order to develop a computationally efficient and parallelizable algorithm for likelihood calculation. We illustrate one possible application to texture discrimination and demonstrate that likelihoodbased methods using our algorithm achieve performance comparable to that of Gaussian Markov random field based techniques, which in general are prohibitively complex computationally. I.
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 29 (3 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...
Multiscale Smoothing Error Models
, 1994
"... A class of multiscale stochastic models based on scalerecursive dynamics on trees has recently been introduced. These models are interesting because they can be used to represent a broad class of physical phenomena and because they lead to efficient algorithms for estimation and likelihood calculat ..."
Abstract

Cited by 23 (12 self)
 Add to MetaCart
A class of multiscale stochastic models based on scalerecursive dynamics on trees has recently been introduced. These models are interesting because they can be used to represent a broad class of physical phenomena and because they lead to efficient algorithms for estimation and likelihood calculation. In this paper, we provide a complete statistical characterization of the error associated with smoothed estimates of the multiscale stochastic processes described by these models. In particular, we show that the smoothing error is itself a multiscale stochastic process with parameters that can be explicitly calculated.
Hierarchical stochastic image grammars for classification and segmentation
 IEEE Trans. Image Processing
, 2006
"... Abstract—We develop a new class of hierarchical stochastic image models called spatial random trees (SRTs) which admit polynomialcomplexity exact inference algorithms. Our framework of multitree dictionaries is the starting point for this construction. SRTs are stochastic hidden tree models whose l ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
Abstract—We develop a new class of hierarchical stochastic image models called spatial random trees (SRTs) which admit polynomialcomplexity exact inference algorithms. Our framework of multitree dictionaries is the starting point for this construction. SRTs are stochastic hidden tree models whose leaves are associated with image data. The states at the tree nodes are random variables, and, in addition, the structure of the tree is random and is generated by a probabilistic grammar. We describe an efficient recursive algorithm for obtaining the maximum a posteriori estimate of both the tree structure and the tree states given an image. We also develop an efficient procedure for performing one iteration of the expectationmaximization algorithm and use it to estimate the model parameters from a set of training images. We address other inference problems arising in applications such as maximization of posterior marginals and hypothesis testing. Our models and algorithms are illustrated through several image classification and segmentation experiments, ranging from the segmentation of synthetic images to the classification of natural photographs and the segmentation of scanned documents. In each case, we show that our method substantially improves accuracy over a variety of existing methods. Index Terms—Dictionary, estimation, grammar, hierarchical model, image classification, probabilistic contextfree grammar, segmentation, statistical image model, stochastic contextfree grammar, tree model. I.
Adaptive wavelet graph model for Bayesian tomographic reconstruction
 IEEE Transactions on Image Processing
, 2002
"... We introduce an adaptive wavelet graph image model applicable to Bayesian tomographic reconstruction and other problems with nonlocal observations. The proposed model captures coarsetofine scale dependencies in the wavelet tree by modeling the conditional distribution of wavelet coefficients give ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We introduce an adaptive wavelet graph image model applicable to Bayesian tomographic reconstruction and other problems with nonlocal observations. The proposed model captures coarsetofine scale dependencies in the wavelet tree by modeling the conditional distribution of wavelet coefficients given overlapping windows of scaling coefficients containing coarse scale information. This results in a graph dependency structure which is more general than a quadtree, enabling the model to produce smooth estimates even for simple wavelet bases such as the Haar basis. The interscale dependencies of the wavelet graph model are specified using a spatially nonhomogeneous Gaussian distribution with parameters at each scale and location. The parameters of this distribution are selected adaptively using nonlinear classification of coarse scale data. The nonlinear adaptation mechanism is based on a set of training images. In conjunction with the wavelet graph model, we present a computationally efficient multiresolution image reconstruction algorithm. This algorithm is based on iterative Bayesian space domain optimization using scale recursive updates of the wavelet graph prior model. In comparison to performing the optimization over the wavelet coefficients, the space domain formulation facilitates enforcement of pixel positivity constraints. Results indicate that the proposed framework can improve reconstruction quality over fixed