Results 1 
6 of
6
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 168 (18 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.
CoherenceEnhancing Diffusion Filtering
, 1999
"... The completion of interrupted lines or the enhancement of flowlike structures is a challenging task in computer vision, human vision, and image processing. We address this problem by presenting a multiscale method in which a nonlinear diffusion filter is steered by the socalled interest operato ..."
Abstract

Cited by 83 (2 self)
 Add to MetaCart
The completion of interrupted lines or the enhancement of flowlike structures is a challenging task in computer vision, human vision, and image processing. We address this problem by presenting a multiscale method in which a nonlinear diffusion filter is steered by the socalled interest operator (secondmoment matrix, structure tensor). An mdimensional formulation of this method is analysed with respect to its wellposedness and scalespace properties. An efficient scheme is presented which uses a stabilization by a semiimplicit additive operator splitting (AOS), and the scalespace behaviour of this method is illustrated by applying it to both 2D and 3D images.
Efficient Image Segmentation Using Partial Differential Equations and Morphology
 Pattern Recognition
, 1998
"... The goal of this paper is to present segmentation algorithms which combine regularization by nonlinear partial differential equations (PDEs) with a watershed transformation with region merging. We develop efficient algorithms for two wellfounded PDE methods. They use an additive operator splitting ( ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
The goal of this paper is to present segmentation algorithms which combine regularization by nonlinear partial differential equations (PDEs) with a watershed transformation with region merging. We develop efficient algorithms for two wellfounded PDE methods. They use an additive operator splitting (AOS) leading to recursive and separable filters. Further speedup can be obtained by embedding AOS schemes into a pyramid framework. Examples are presented which demonstrate that the preprocessing by these PDE techniques eases and stabilizes the segmentation. The typical CPU time for segmenting a 256 2 image on a workstation is less than 2 seconds. Key Words: Nonlinear diffusion, additive operator splitting, Gaussian pyramid, watershed segmentation, region merging CR Subject Classification: I.4.6, I.4.3, I.4.4. 1 Introduction Segmentation is one of the bottlenecks of many image analysis and computer vision tasks ranging from medical image processing to robot navigation. Ideally it sho...
Parallel Implementations of AOS Schemes: A Fast Way of Nonlinear Diffusion Filtering
 In Proc. 1997 IEEE International Conference on Image Processing
, 1997
"... In most cases nonlinear diffusion filtering is implemented by means of explicit finite difference schemes. These algorithms are not very efficient, since they are only stable for small time steps. We address this problem by presenting unconditionally stable semiimplicit schemes which are based on a ..."
Abstract

Cited by 16 (4 self)
 Add to MetaCart
In most cases nonlinear diffusion filtering is implemented by means of explicit finite difference schemes. These algorithms are not very efficient, since they are only stable for small time steps. We address this problem by presenting unconditionally stable semiimplicit schemes which are based on an additive operator splitting (AOS). They are very efficient since they can be implemented by recursive filtering, and their separability allows a straightforward implementation in any dimension. We analyse their behaviour on a parallel computer and demonstrate that parallel AOS schemes on a modern sharedmemory multiprocessor system with 8 processors allow a speedup of two orders of magnitude in comparison to the widelyused explicit scheme on a single processor. c fl1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to server...
Recursive Separable Schemes for Nonlinear Diffusion Filters
, 1997
"... Poor efficiency is a typical problem of nonlinear diffusion filtering, when the simple and popular explicit (Eulerforward) scheme is used: for stability reasons very small time step sizes are necessary. In order to overcome this shortcoming, a novel type of semiimplicit schemes is studied, socall ..."
Abstract

Cited by 11 (4 self)
 Add to MetaCart
Poor efficiency is a typical problem of nonlinear diffusion filtering, when the simple and popular explicit (Eulerforward) scheme is used: for stability reasons very small time step sizes are necessary. In order to overcome this shortcoming, a novel type of semiimplicit schemes is studied, socalled additive operator splitting (AOS) methods. They share the advantages of explicit and (semi)implicit schemes by combining simplicity with absolute stability. They are reliable, since they satisfy recently established criteria for discrete nonlinear diffusion scalespaces. Their efficiency is due to the fact that they can be separated into onedimensional processes, for which a fast recursive algorithm with linear complexity is available. AOS schemes reveal good rotational invariance and they are symmetric with respect to all axes. Examples demonstrate that, under typical accuracy requirements, they are at least ten times more efficient than explicit schemes.
ARTICLE IN PRESS
, 2009
"... Journal of Computational Physics journal homepage: www.elsevier.com/locate/jcp 2 Stable looselycoupledtype algorithm for fluidâ€“structure interaction ..."
Abstract
 Add to MetaCart
Journal of Computational Physics journal homepage: www.elsevier.com/locate/jcp 2 Stable looselycoupledtype algorithm for fluidâ€“structure interaction