Fast 3D Mean Shift Filter for CT Images

Gustavo Fernández Domínguez; Horst Bischof; Reinhard Beichel

doi:10.1007/3-540-45103-X_59

Back

Book chapter

Open access

Peer reviewed

Fast 3D Mean Shift Filter for CT Images

Gustavo Fernández Domínguez, Horst Bischof and Reinhard Beichel

Image Analysis, pp.438-445

Lecture Notes in Computer Science, Springer Berlin Heidelberg

06/24/2003

DOI: 10.1007/3-540-45103-X_59

Files and links (1)

url

https://doi.org/10.1007/3-540-45103-X_59View

Published (Version of record) Open Access

Abstract

In this paper we investigate the ability of the mean shift (MS) algorithm for denoising of 3D Computer Tomography (CT) data sets. The large size of the volume data sets makes it infeasible to apply a 3D version of the MS algorithm directly. Therefore, we introduce a variant of the MS algorithm using information propagation. We would like to make use of the 3D nature of the data with a considerably reduced running time of the algorithm. The proposed version is compared to a 2D implementation of the same algorithm applied slice by slice and other filter methods such as median filter and bilateral filtering. The advantages and disadvantages of each algorithm are shown on different CT data sets.

Computer Tomography Imaging

Mean Shift Filter

Nonlinear Filtering

Details

Title: Subtitle: Fast 3D Mean Shift Filter for CT Images
Creators: Gustavo Fernández Domínguez - Graz University of Technology
Horst Bischof - Graz University of Technology
Reinhard Beichel - Graz University of Technology
Resource Type: Book chapter
Publication Details: Image Analysis, pp.438-445
Publisher: Springer Berlin Heidelberg; Berlin, Heidelberg
Series: Lecture Notes in Computer Science
DOI: 10.1007/3-540-45103-X_59
eISSN: 1611-3349
ISSN: 0302-9743
Language: English
Date published: 06/24/2003
Academic Unit: Electrical and Computer Engineering
Record Identifier: 9984197228002771

Metrics

52 Record Views