Results 1  10
of
573
Efficient and Reliable Schemes for Nonlinear Diffusion Filtering
 IEEE Transactions on Image Processing
, 1998
"... Nonlinear diffusion filtering is usually performed with explicit schemes. They are only stable for very small time steps, which leads to poor efficiency and limits their practical use. Based on a recent discrete nonlinear diffusion scalespace framework we present semiimplicit schemes which are sta ..."
Abstract

Cited by 185 (20 self)
 Add to MetaCart
Nonlinear diffusion filtering is usually performed with explicit schemes. They are only stable for very small time steps, which leads to poor efficiency and limits their practical use. Based on a recent discrete nonlinear diffusion scalespace framework we present semiimplicit schemes which are stable for all time steps. These novel schemes use an additive operator splitting (AOS) which guarantees equal treatment of all coordinate axes. They can be implemented easily in arbitrary dimensions, have good rotational invariance and reveal a computational complexity and memory requirement which is linear in the number of pixels. Examples demonstrate that, under typical accuracy requirements, AOS schemes are at least ten times more efficient than the widelyused explicit schemes.
A local update strategy for iterative reconstruction from projections
 IEEE Tr. Sig. Proc
, 1993
"... Iterative methods for statisticallybased reconstruction from projections are computationally costly relative to convolution backprojection, but allow useful image reconstruction from sparse and noisy data. We present a method for Bayesian reconstruction which relies on updates of single pixel value ..."
Abstract

Cited by 128 (31 self)
 Add to MetaCart
Iterative methods for statisticallybased reconstruction from projections are computationally costly relative to convolution backprojection, but allow useful image reconstruction from sparse and noisy data. We present a method for Bayesian reconstruction which relies on updates of single pixel values, rather than the entire image, at each iteration. The technique is similar to GaussSeidel (GS) iteration for the solution of differential equations on finite grids. The computational cost per iteration of the GS approach is found to be approximately equal to that of gradient methods. For continuously valued images, GS is found to have significantly better convergence at modes representing high spatial frequencies. In addition, GS is well suited to segmentation when the image is constrained to be discretely valued. We demonstrate that Bayesian segmentation using GS iteration produces useful estimates at much lower signaltonoise ratios than required for continuously valued reconstruction. This paper includes analysis of the convergence properties of gradient ascent and GS for reconstruction from integral projections, and simulations of both maximumlikelihood and maximum a posteriori cases.
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 125 (17 self)
 Add to MetaCart
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
Scattered Data Interpolation with Multilevel Splines
 IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS
, 1997
"... This paper describes a fast algorithm for scattered data interpolation and approximation. Multilevel Bsplines are introduced to compute a C²continuous surface through a set of irregularly spaced points. The algorithm makes use of a coarsetofine hierarchy of control lattices to generate a sequen ..."
Abstract

Cited by 117 (10 self)
 Add to MetaCart
This paper describes a fast algorithm for scattered data interpolation and approximation. Multilevel Bsplines are introduced to compute a C²continuous surface through a set of irregularly spaced points. The algorithm makes use of a coarsetofine hierarchy of control lattices to generate a sequence of bicubic Bspline functions whose sum approaches the desired interpolation function. Large performance gains are realized by using Bspline refinement to reduce the sum of these functions into one equivalent Bspline function. Experimental results demonstrate that highfidelity reconstruction is possible from a selected set of sparse and irregular samples.
Diffusion snakes: introducing statistical shape knowledge into the MumfordShah functional
 J. OF COMPUTER VISION
, 2002
"... We present a modification of the MumfordShah functional and its cartoon limit which facilitates the incorporation of a statistical prior on the shape of the segmenting contour. By minimizing a single energy functional, we obtain a segmentation process which maximizes both the grey value homogeneit ..."
Abstract

Cited by 106 (15 self)
 Add to MetaCart
We present a modification of the MumfordShah functional and its cartoon limit which facilitates the incorporation of a statistical prior on the shape of the segmenting contour. By minimizing a single energy functional, we obtain a segmentation process which maximizes both the grey value homogeneity in the separated regions and the similarity of the contour with respect to a set of training shapes. We propose a closedform, parameterfree solution for incorporating invariance with respect to similarity transformations in the variational framework. We show segmentation results on artificial and realworld images with and without prior shape information. In the cases of noise, occlusion or strongly cluttered background the shape prior significantly improves segmentation. Finally we compare our results to those obtained by a level set implementation of geodesic active contours.
Adaptive fuzzy segmentation of magnetic resonance images
 IEEE TRANS. MED. IMAG
, 1999
"... An algorithm is presented for the fuzzy segmentation of twodimensional (2D) and threedimensional (3D) multispectral magnetic resonance (MR) images that have been corrupted by intensity inhomogeneities, also known as shading artifacts. The algorithm is an extension of the 2D adaptive fuzzy Cme ..."
Abstract

Cited by 101 (9 self)
 Add to MetaCart
An algorithm is presented for the fuzzy segmentation of twodimensional (2D) and threedimensional (3D) multispectral magnetic resonance (MR) images that have been corrupted by intensity inhomogeneities, also known as shading artifacts. The algorithm is an extension of the 2D adaptive fuzzy Cmeans algorithm (2D AFCM) presented in previous work by the authors. This algorithm models the intensity inhomogeneities as a gain field that causes image intensities to smoothly and slowly vary through the image space. It iteratively adapts to the intensity inhomogeneities and is completely automated. In this paper, we fully generalize 2D AFCM to threedimensional (3D) multispectral images. Because of the potential size of 3D image data, we also describe a new faster multigridbased algorithm for its implementation. We show, using simulated MR data, that 3D AFCM yields lower error rates than both the standard fuzzy Cmeans (FCM) algorithm and two other competing methods, when segmenting corrupted images. Its efficacy is further demonstrated using real 3D scalar and multispectral MR brain images.
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 96 (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
A Multilevel Relaxation Algorithm for Simultaneous Localisation and Mapping
, 2004
"... This paper addresses the problem of simultaneous localisation and mapping (SLAM) by a mobile robot. An incremental SLAM algorithm is introduced that is derived from multigrid methods used for solving partial differential equations. The approach improves on the performance of previous relaxation meth ..."
Abstract

Cited by 93 (5 self)
 Add to MetaCart
This paper addresses the problem of simultaneous localisation and mapping (SLAM) by a mobile robot. An incremental SLAM algorithm is introduced that is derived from multigrid methods used for solving partial differential equations. The approach improves on the performance of previous relaxation methods for robot mapping because it optimizes the map at multiple levels of resolution. The resulting algorithm has an update time that is linear in the number of estimated features for typical indoor environments, even when closing very large loops, and offers advantages in handling nonlinearities compared to other SLAM algorithms. Experimental comparisons with alternative algorithms using two wellknown data sets and mapping results on a real robot are also presented.