Welcome!
To use the personalized features of this site, please log in or register.
If you have forgotten your username or password, we can help.
|
 |
Designing 3-D Nonlinear Diffusion Filters for High Performance Cluster Computing
| Book Series | Lecture Notes in Computer Science |
| Publisher | Springer Berlin / Heidelberg |
| ISSN | 0302-9743 (Print) 1611-3349 (Online) |
| Volume | Volume 2449/2002 |
| Book | Pattern Recognition |
| DOI | 10.1007/3-540-45783-6 |
| Copyright | 2002 |
| ISBN | 978-3-540-44209-7 |
| DOI | 10.1007/3-540-45783-6_35 |
| Pages | 290-297 |
| Subject Collection | Computer Science |
| SpringerLink Date | Saturday, January 12, 2008 |
| |
|
Designing 3-D Nonlinear Diffusion Filters for High Performance Cluster Computing
Andrés Bruhn5 , Tobias Jakob6 , Markus Fischer6 , Timo Kohlberger7 , Joachim Weickert5 , Ulrich Brüning6 and Christoph Schnörr7 
| (5) |
Mathematical Image Analysis Group, Faculty of Mathematics and Computer Science, Saarland University, Building 27.1, 66041 Saarbrücken, Germany |
| (6) |
Computer Architecture Group, Department of Mathematics and Computer Science, University of Mannheim, 68131 Mannheim, Germany |
| (7) |
Computer Vision, Graphics, and Pattern Recognition Group, Department of Mathematics and Computer Science, University of Mannheim, 68131 Mannheim, Germany |
Abstract
This paper deals with parallelization and implementation aspects of PDE based image processing models for large cluster environments
with distributed memory. As an example we focus on nonlinear isotropic diffusion filtering which we discretize by means of
an additive operator splitting (AOS). We start by decomposing the algorithm into small modules that shall be parallelized
separately. For this purpose image partitioning strategies are discussed and their impact on the communication pattern and
volume is analyzed. Based on the results we develop an algorithmic implementation with excellent scaling properties on massively
connected low latency networks. Test runs on a high-end Myrinet cluster yield almost linear speedup factors up to 209 for
256 processors. This results in typical denoising times of 0.5 seconds for five iterations on a 256 × 256 × 128 data cube.
Keywords diffusion filtering - additive operator splitting - cluster computing
Fulltext Preview (Small, Large)
 References secured to subscribers.
|
|
|
|
|
|