Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||C-library raft: Reconstruction algorithms for tomography. Applications to X-ray fluorescence tomography|
De Pierro, AR
|Abstract:||There are many reconstruction algorithms for tomography, raft for short, and some of them are considered "classic" by researchers. The so-called raft library, provide a set of useful and basic tools, usually needed in many inverse problems that are related to medical imaging. The subroutines in raft are free software and written in C language; portable to any system with a working C compiler. This paper presents source codes written according to raft routines, applied to a new imaging modality called X-ray fluorescence tomography. Program summary Program title: raft Catalogue identifier: AEJY_v1_0 Program summary URL: http://cpc.cs.qub.ac.uk/summaries/AEJY_v1_0.html Program obtainable from: CPC Program Library. Queen's University, Belfast, N. Ireland Licensing provisions: GNU General Public Licence. version 2 No. of lines in distributed program, including test data, etc.: 218 844 No. of bytes in distributed program, including test data, etc.: 3 562 902 Distribution format: tar.gz Programming language: Standard C. Computer: Any with a standard C compiler Operating system: Linux and Windows Classification: 2.4, 2.9, 3, 4.3, 4.7 External routines: raft: autoconf 2.60 or later - http://www.gnu.org/software/autoconf/ GSL scientific library - Imp://www.gnu.org/software/gsl/ Confuse parser library - http://www.nongnu.org/confuse/ raft-fun: gengeropt - hap://www.gnu.org/software/gengeropt/gengetopthtml Nature of problem: Reconstruction algorithms for tomography, specially in X-ray fluorescence tomography. Solution method: As a library, raft covers the standard reconstruction algorithms like filtered backprojection, Novikov's inversion, Hogan's formula, among others. The input data set is represented by a complete sinogram covering a determined angular range. Users are allowed to set solid angle range for fluorescence emission at each algorithm. Running time: 1 second to 15 minutes, depending on the data size. (C) 2011 Elsevier B.V. All rights reserved.|
|Editor:||Elsevier Science Bv|
|Appears in Collections:||Artigos e Materiais de Revistas Científicas - Unicamp|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.