• Aucun résultat trouvé

Application of Diagonally Relaxed OrthogonalProjections (DROP)- conjugate gradient andKaczmarz method for X Rays reconstructionimage

N/A
N/A
Protected

Academic year: 2021

Partager "Application of Diagonally Relaxed OrthogonalProjections (DROP)- conjugate gradient andKaczmarz method for X Rays reconstructionimage"

Copied!
1
0
0

Texte intégral

(1)

7th African Conference on Non Destructive Testing (ACNDT 2016) 2016

Application of Diagonally Relaxed Orthogonal Projections (DROP)- conjugate gradient and Kaczmarz method for X Rays reconstruction

image

L. Cherrad, R. Drai, H.Bendjama, D.Idiou

Abstract : In this work, we present the application of algorithms based on algebraic methods, ray tomography image reconstruction X. So DROP algorithms with quadratic regularization (orthogonal projections Relaxes diagonal), conjugate gradient and Kaczmarz will be implemented and applied to real images obtained by an X-ray tomography, a comparative study was made in order to examine the reconstruction algorithms results

Keywords : DROP method, regularization, Tomography, Kaczmarz method

Centre de Recherche en Technologies Industrielles - CRTI - www.crti.dz

Powered by TCPDF (www.tcpdf.org)

Références

Documents relatifs

conjugate gradient, deflation, multiple right-hand sides, Lanczos algorithm AMS subject classifications.. A number of recent articles have established the benefits of using

An Augmented Conjugate Gradient Method for Solving Consecutive Symmetric Positive Definite Linear Systems... AN AUGMENTED CONJUGATE GRADIENT METHOD FOR

So DROP algorithms with quadratic regularization (orthogonal projections Relaxes diagonal), conjugate gradient and Kaczmarz will be implemented and applied to real

Keywords: Brain image segmentation; Hidden Markov Random Field; The Conjugate Gradient algorithm; Dice Coefficient metric..

Unit´e de recherche INRIA Rennes, Irisa, Campus universitaire de Beaulieu, 35042 RENNES Cedex Unit´e de recherche INRIA Rhˆone-Alpes, 655, avenue de l’Europe, 38330 MONTBONNOT ST

Due to this increase in time per iteration, ssSNPBLUP_Liu using double precision reals needed about 56% more wall clock time to complete than ssSNPBLUP_Liu using Plink 1 binary

As a result, the two new adaptive MPCG algorithms namely, Algorithm 2 with the global τ –test, and Algorithm 3 with the local τ –test can straightforwardly be applied to the BDD

On graph of time, we can see that, for example, for n = 15 time in ms of conjugate gradient method equals 286 and time in ti of steepst descent method equals 271.. After that, we