Professional Documents
Culture Documents
Abstract
The article set up a image reconstructions task which is implemented by retrieving the data supplied
from X-ray. Also the problems concerned about solving algorithm are disscused.
Especially attension is paid to digitizing the X-ray data and FFT ( Fast Fourier Transformation )
application in optimizing computerized tomography algorithm
A
I(x)
I(x+dx)
x+dx
A,
dI ( x ) = ( x ) I ( x )dx
(1)
H s t l trong (1) c gi l h s hp th tuyn tnh, trong du tr ly t
iu kin dng. H s ny l hm s ca 3 to khng gian (x,y,z)= (x1,x2,x3) to
I ( x ) = I o exp( ( x )dx )
(2)
= xcos + ysin,
= -xsin + ycos
(3)
x = cos - sin
y = sin + cos
Tng ng vi cng thc (2) ta c dng:
(4)
I ( , ) = I 0 exp( [x, y ]d )
(5)
B)
A
A)
[x, y ]d
(6)
f ( x) exp(ix)dx
f*() = (2)-1/2
(7)
f(x) = (2)-1/2
( ) exp(ix)d
(8)
- n/2
(9)
(10)
(11)
( x, y) = (2 )
- 3/2
p * ( , + / 2) exp(i(ux + vy))dudv
(13)
U
O
(14)
1
(x,y) =
2
*
*
g ( )h ( ) exp(i(ux + vy)dudv
(15)
(r,) = (2)-3/2
(17)
Lu rng:
cos(-)=- cos( + ), p * (, + / 2) = p * (, + 3 / 2)
(18)
Cng thc th nht trong (18) l ng thc lng gic c bn, cng thc th 2 rt ra t
iu kin thc hin vt l. Tnh n cc cng thc ny c th vit tch phn v phi ng
thc (17) di dng:
( , ) = (2 ) 3 / 2 d
0
*
p ( , + / 2)exp(ir cos( ))d
(19)
Trn thc t khi thc hin cng thc (19) biu thc di du tch phn c nhn trc
vi mt hm A () c chn mt cch c bit v c gi l hm apodize c tc dng
ct cc hi bc cao. Theo thut ng s dng trong l thuyt iu khin tch ca ht nhn ||
trong php chp (19) vi hm apodize c gi l b lc, cn ton t gii phng trnh
chp (19) c s dng hm apodize c gi l php lc. Do hm nhn c sau khi tnh
tch phn bn trong ca (19) c bin i theo cng thc tng t nh php chiu ngc
nn ni chung phng php ny mang tn l phng php chiu ngc dng lc.
Trn thc t ngi ta dng cc hm apodize di cc dng sau:
khi max
0 khi > max
a.
A* =
b.
A* =
c.
A*=
V chp ct lp s dng my tnh iu khin vic ghi nhn thng tin t cc phn t
cm bin, sau lu gi v chun b thng tin cho vic chn on, nn mt trong s cc
vn c bn l ri rc ha - tc l chuyn t cc phn b lin tc theo to v thi gian
sang cc hm ri rc vi cc i s ri rc. Ni chung, cc kha cnh thc t c bn lin
quan n vn ri rc ha bao gm:
1. Bin i Fourier ri rc
2. Thut ton bin i Fourier nhanh (FFT)
3 .Thit lp ngng ri rc ho cn thit (nh l Kachenhicop Sennon)
4. Cc phng php ni suy
5. Cc phng php lp khi phc cu trc.
Trong s ny ch c kha cnh cui cng l mang tnh c th ca bi ton chp ct
lp nn ta xt k di y.
Cc phng php lp khi phc cu trc.
Xt li phng trnh c bn (6) ca chp ct lp my tnh v gi thit hm ( x , y )
c cho trc mt cch gn ng trong vng D bng mt s hu hn cc tham s, v d
nh cc gi tr 1 , 2 ,...s ti cc nt ca mng li cc phn t hu hn. S dng mt
php ni suy no cho hm ( x , y ) trong vng, c th tnh tch phn di dng hm
tuyn tnh no ca cc tham s i cho mi tia vi cc tham s , :
p ( , ) A ( i ) ( , ) i
(20)
A
i =1
(i )
jk
= p ik
(21)
A
i =1
ij
= pi
(22)
gii h (22) c th s dng cc thut ton chun ca i s tuyn tnh, tuy nhin
nu ch rng t ti phn gii chp nhn c ca thit b phi s dng hng nghn
gi tr ( x , y ) , th ma trn Aij s cha khong 1010 phn t. iu ny dn n l trn
thc t gii cc h dng (22) ngi ta ch s dng phng php lp. Ngoi ra cc phng
php lp cn c s dng gii cc h v nh v phim nh, ng thi chng cng d
ci tin khc phc cc vn lin quan vi tnh khng chun ca bi ton xc nh cu
trc bn trong theo kt qu o bn ngoi cu trc.
Di y lit k mt s cc thut ton lp ph bin nht dng gii cc bi ton
chp ct lp my tnh [3].
7
i( k +1) = ( k ) + k H ij( k ) ( Pj A jl l( k )
j
(2.102)
c chn t
4. Kt lun
[1]
[2]
a aa a .
. a. . 2- a. . . a. .,
, 1991. 1 407 ., 2- 406 .
[3]
[4]
aa