Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

A gradient-based optimisation scheme for optical tomography

Open Access Open Access

Abstract

Optical tomography schemes using non-linear optimisation are usually based on a Newton-like method involving the construction and inversion of a large Jacobian matrix. Although such matrices can be efficiently constructed using a reciprocity principle, their inversion is still computationally difficult. In this paper we demonstrate a simple means to obtain the gradient of the objective function directly, leading to straightforward application of gradient-based optimisation methods.

©1998 Optical Society of America

Full Article  |  PDF Article
More Like This
Spatial location weighted optimization scheme for DC optical tomography

Jun Zhou, Jing Bai, and Ping He
Opt. Express 11(2) 141-150 (2003)

3D level set reconstruction of model and experimental data in Diffuse Optical Tomography

M. Schweiger, O. Dorn, A. Zacharopoulos, I. Nissilä, and S. R. Arridge
Opt. Express 18(1) 150-164 (2010)

Supplementary Material (8)

Media 1: MOV (415 KB)     
Media 2: MOV (611 KB)     
Media 3: MOV (279 KB)     
Media 4: MOV (602 KB)     
Media 5: MOV (744 KB)     
Media 6: MOV (485 KB)     
Media 7: MOV (880 KB)     
Media 8: MOV (436 KB)     

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (4)

Figure 1.
Figure 1. Target image (col. 1), reconstruction after 100 iterations with conjugate gradient method (col. 2), with steepest descent method (col. 3) and with ART method (col. 4). In all cases, the top image is μa , and the bottom image is μs . The animations linked to the figure show the first 50 reconstruction iterations, and the final 50 in steps of 10. [Media 1] [Media 2] [Media 3] [Media 4] [Media 5] [Media 6]
Figure 2.
Figure 2. L2 data norms as a function of iteration number, for different algorithms, as a function of iteration number (left) and of runtime (right).
Figure 3.
Figure 3. L2 solution norms as a function of iteration number, for different algorithms. Left: absorption, right: scatter.
Figure 4.
Figure 4. Target image (left col.), reconstruction after 100 iterations with conjugate gradient method (right col.). Top row is μa , bottom row is μs . The animations linked to the figure show the first 50 reconstruction iterations, and the final 50 in steps of 10. [Media 7] [Media 8]

Tables (2)

Tables Icon

Table 1. Optical parameters of circular test object.

Tables Icon

Table 2. Optical parameters of neonatal head model.

Equations (44)

Equations on this page are rendered with MathJax. Learn more.

F = 𝛲 [ μ , κ ]
Ψ = 1 2 j = 1 S i = 1 M j ( y j , i 𝛲 j , i [ μ , κ ] σ j , i ) 2
Ψ = 1 2 ( y F ) T R 2 ( y F ) = 1 2 b T b
R = diag R 1 R 2 R S = diag ( σ 1,1 , σ 1,2 , σ j , i , σ S , M s )
κ ( r ) Φ ̂ r ω + μ ( r ) Φ ̂ ( r , ω ) + ιω c Φ ̂ r ω = q ̂ 0 r t ,
κ ( r ) Φ r t + μ ( r ) Φ ( r , t ) + 1 c Φ ( r , t ) t = q 0 r t ,
Γ ( ξ ) = ( ξ ) n ̂ Φ ( ξ ) ,
Φ ( ξ ) + κ α n ̂ Φ ( ξ ) = 0 ,
( K ( κ ) + C ( μ ) + αA + ιω B ) Φ ( ω ) = Q ( ω )
( K ( κ ) + C ( μ ) + αA ) Φ ( t ) + B Φ ( t ) t = Q ( t )
K ij = Ω κ ( r ) u i ( r ) u j ( r ) d n r
C ij = Ω μ ( r ) u i ( r ) u j ( r ) d n r
B ij = 1 c Ω u i ( r ) u j ( r ) d n r
A ij = Ω u i ( r ) u j ( r ) d ( Ω )
F j = 𝚳 [ Φ j ]
𝚳 ̅ = τ ε
time - gated intensity : 𝚳 E ¯ ( T ) [ Φ ( t ) ] = 1 ε [ Φ ( t ) ] 0 T B [ Φ ( t ) ] dt ,
n - th temporal moment : 𝚳 t n [ Φ ( t ) ] = 1 ε [ Φ ( t ) ] 0 t n B [ Φ ( t ) ] dt ,
n - th central moment : 𝚳 c n [ Φ ( t ) ] = 1 ε [ Φ ( t ) ] 0 ( t t ) n B [ Φ ( t ) ] dt ,
normalised Laplace transform : 𝚳 L ̅ ( s ) [ Φ ( t ) ] = 1 ε [ Φ ( t ) ] 0 e st B [ Φ ( t ) ] dt .
Ψ x k = j = 1 S i = 1 M j ( y j , i P j , i [ μ , κ ] σ j , i 2 ) ( P j , i [ μ , κ ] x k )
z = j = 1 S P ' j T R j 1 b j = P ' T R 1 b
= j = 1 S J j T b j = J T b
b 1 b 2 . . . b S = J 1 , ( μ ) J 1 , ( κ ) J 2 , ( μ ) J 2 , ( κ ) . . . . . . J S , ( μ ) J S , ( κ ) Δ μ Δ κ
J j i = P MD F ( j , i ) T = [ P MD F ( j , i ) , ( μ ) T P MD F ( j , i ) , ( κ ) T ]
z = J T b
= j = 1 S J j T b j
= j = 1 S j = 1 M j P MD F ( j , i ) T b j , i
( K + C + αA ι ω B ) Φ m + ( ω ) = Q i + ( ω )
z ( μ ) = j = 1 S i = 1 M j b j , i σ j , i Φ i + ( ω ) × Φ j ( ω )
z ( κ ) = j = 1 S i = 1 M j b j , i σ j , i Φ i + ( ω ) × Φ j ( ω )
ν j + ( ω ) = i = 1 M j b j , i σ j , i Q i + ( ω )
( K + C + αA ι ω B ) η j + ( ω ) = ν j + ( ω )
z ( μ ) = j = 1 S η j + ( ω ) × Φ j ( ω )
z ( κ ) = j = 1 S η j + ( ω ) × Φ j ( ω )
J j i 𝚳 ̅ = 1 F j , i ε ( J j i 𝚳 F j , i 𝚳 ̅ J j i ε )
J 𝚳 ̅ T b 𝚳 ̅ = j S i M j J j i 𝚳 ̅ b j , i 𝚳 ̅
= j S i M j 1 F j , i ε ( J j i 𝚳 F j , i 𝚳 ̅ J j i ε ) b j , i 𝚳 ̅
z ( μ ) 𝚳 ̅ = j S i M j b j , i 𝚳 ̅ σ j , i 𝚳 ̅ F j , i ε ( τ [ Φ i + × Φ j ] F j , i 𝚳 ̅ Φ i + × Φ j )
z ( κ ) 𝚳 ̅ = j S i M j b j , i 𝚳 ̅ σ j , i 𝚳 ̅ F j , i ε ( τ [ Φ i + × Φ j ] F j , i 𝚳 ̅ Φ i + × Φ j )
ν j 𝚳 ̅ + ( 0 ) = i = 1 M j b j , i 𝚳 ̅ F j , i 𝚳 ̅ σ j , i 𝚳 ¯ F j , i ε Q i +
ν j 𝚳 ̅ + ( 1 ) = i = 1 M j b j , i 𝚳 ̅ σ j , i 𝚳 ¯ F j , i ε Q i +
z ( μ ) 𝚳 ̅ = j S τ [ η j 𝚳 ̅ + ( 1 ) × Φ j ] η j 𝚳 ¯ + ( 0 ) × Φ j
z ( κ ) 𝚳 ̅ = j S τ [ η j 𝚳 ̅ + ( 1 ) × Φ j ] η j 𝚳 ¯ + ( 0 ) × Φ j
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.