In iterative reconstruction in digital imaging, interior reconstruction (also known as limited field of view (LFV) reconstruction) is a technique to correct truncation artifacts caused by limiting image data to a small field of view. The reconstruction focuses on an area known as the region of interest (ROI). Although interior reconstruction can be applied to dental or cardiac CT images, the concept is not limited to CT. It is applied with one of several methods.
The purpose of each method is to solve for vector
x
\begin{bmatrix} f\ g \end{bmatrix}= \begin{bmatrix} A&B\\ C&D \end{bmatrix} \begin{bmatrix} x\\ y \end{bmatrix}.
Let
X
Y
X
A
B
C
D
x
y
f
g
f
g
x
X
x\inX
y
Y
y\inY
X
f
X
F
f\inF
g
F
Y
G
g\inG
For CT image-reconstruction purposes,
C=0
To simplify the concept of interior reconstruction, the matrices
A
B
C
D
The first interior-reconstruction method listed below is extrapolation. It is a local tomography method which eliminates truncation artifacts but introduces another type of artifact: a bowl effect. An improvement is known as the adaptive extrapolation method, although the iterative extrapolation method below also improves reconstruction results. In some cases, the exact reconstruction can be found for the interior reconstruction. The local inverse method below modifies the local tomography method, and may improve the reconstruction result of the local tomography; the iterative reconstruction method can be applied to interior reconstruction. Among the above methods, extrapolation is often applied.
\begin{bmatrix} f\ g \end{bmatrix}= \begin{bmatrix} A&B\\ C&D \end{bmatrix} \begin{bmatrix} x\\ y \end{bmatrix}
A
B
C
D
x
y
f
g
x
x
y
f
g
x
X
x\inX
y
X
Y
y\inY
f
X
F
f\inF
g
F
Y
G
g\inG
C=0
To simplify the concept of interior reconstruction, the matrices
A
B
C
D
The response in the outside region can be a guess
G
gex
\begin{bmatrix} x0\ y0 \end{bmatrix}= \begin{bmatrix} A&B\\ C&D \end{bmatrix}-1\begin{bmatrix} f\\ gex\end{bmatrix}
A solution of
x
x0
gex
gex|\partial=f|\partial
Assume a rough solution,
x0
y0
g1
g1=Cx0+Dy0
The reconstructed image can be calculated as follows:
\begin{bmatrix} x1\ y1 \end{bmatrix}= \begin{bmatrix} A&B\\ C&D \end{bmatrix}-1\begin{bmatrix} f\\ g1+g1ex\end{bmatrix}
It is assumed that
f|\partial=(g1+g1ex)|\partial
x1
g1ex
It is assumed that a rough solution,
x0
y0
\begin{bmatrix} f1\ g1 \end{bmatrix}= \begin{bmatrix} A&B\\ C&D \end{bmatrix} \begin{bmatrix} 0\\ y0 \end{bmatrix}
or
f1=By0
The reconstruction can be obtained as
\begin{bmatrix} x1\ y1 \end{bmatrix}= \begin{bmatrix} A&B\\ C&D \end{bmatrix}-1\begin{bmatrix} f-f1\\ gex\end{bmatrix}
Here
g1ex
(f-f1)|\partial=g1ex|\partial
x1
Local tomography, with a very short filter, is also known as lambda tomography.[12] [13]
The local inverse method extends the concept of local tomography. The response in the outside region can be calculated as follows:
f=Ax+By
Consider the generalized inverse
B+
BB+B=B
Define
Q=[I-BB+]
so that
QB=0
Qf=QAx
The above equation can be solved as
x1=A+Q+Qf
considering that
QQ=Q
QQQ=Q
Q
Q
Q+=Q
The solution can be simplified as
x1=A+Qf
The matrix
A+Q=A+[I-BB+]
{\begin{bmatrix} A&B\\ C&D\\ \end{bmatrix}}
A
Here a goal function is defined, and this method iteratively achieves the goal. If the goal function can be some kind of normal, this is known as the minimal norm method.
min(R\|x\|+S\|y\|+T\|g\|)
\begin{bmatrix} x\ y \end{bmatrix}= \begin{bmatrix} A&B\\ C&D \end{bmatrix}-1\begin{bmatrix} f\\ g \end{bmatrix}
f
where
R
S
T
\| ⋅ \|
L0
L1
L2
L+infty
In special situations, the interior reconstruction can be obtained as an analytical solution; the solution of
x
Extrapolated data often convolutes to a kernel function. After data is extrapolated its size is increased N times, where N = 2 ~ 3. If the data needs to be convoluted to a known kernel function, the numerical calculations will increase log(N)·N times, even with the fast Fourier transform (FFT). An algorithm exists, analytically calculating the contribution from part of the extrapolated data. The calculation time can be omitted, compared to the original convolution calculation; with this algorithm, the calculation of a convolution using the extrapolated data is not noticeably increased. This is known as fast extrapolation.[19]
The extrapolation method is suitable in a situation where
|x|>|y|
|X|>|Y|
i.e. a small truncation artifacts situation.
The adaptive extrapolation method is suitable for a situation where
|x|\sim|y|
|X|\sim|Y|
i.e. a normal truncation artifacts situation. This method also offers a rough solution for the exterior region.
The iterative extrapolation method is suitable for a situation in which
|x|\sim|y|
|X|\sim|Y|
i.e. a normal truncation artifacts situation. Although this method gets better interior reconstruction compared to adaptive reconstruction, it misses the result in the exterior region.
Local tomography is suitable for a situation in which
|x|\ll|y|
|X|\ll|Y|
i.e. a largest truncation artifacts situation. Although there are no truncation artifacts in this method, there is a fixed error (independent of the value of
|y|
The local inverse method, identical to local tomography, suitable in a situation in which
|x|\ll|y|
|X|\ll|Y|
i.e. a largest truncation artifacts situation. Although there are no truncation artifacts for this method, there is a fixed error (independent of the value of
|y|
The iterative reconstruction method obtains a good result with large calculations. Although the analytic method achieves an exact result, it is only functional in some situations. The fast extrapolation method can get the same results as the other extrapolation methods, and can be applied to the above interior reconstruction methods to reduce the calculation.