Interior reconstruction

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.

Uses your system voice; voice and rate in settings.

≈ 7 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

Methods

The purpose of each method is to solve for vector x in the following problem: \begin{bmatrix} f \\ g \end{bmatrix}= \begin{bmatrix} A & B \\ C & D \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix}. Let X be the region of interest (ROI) and Y be the region outside of X . Assume A , B , C , D are known matrices; x and y are unknown vectors of the original image, while f and g are vector measurements of the responses ( f is known and g is unknown). x is inside region X , ( x \in X ) and y , in the region Y , ( y \in Y ), is outside region X . f is inside a region in the measurement corresponding to X . This region is denoted as F , ( f \in F ), while g is outside of the region F . It corresponds to Y and is denoted as G , ( g \in G ). For CT image-reconstruction purposes, C = 0 .

To simplify the concept of interior reconstruction, the matrices A , B , C , D are applied to image reconstruction instead of complex operators. 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. \end{bmatrix}= \begin{bmatrix} A & B \\ C & D \end{bmatrix} \begin{bmatrix} x \\ y \end{bmatrix} A , B , C , D are known matrices; x and y are unknown vectors; f is a known vector, and g is an unknown vector.

We need to know the vector x . x and y are the original image, while f and g are measurements of responses. Vector x is inside the region of interest X , ( x \in X ). Vector y is outside the region X . The outside region is called Y , ( y \in Y ) and f is inside a region in the measurement corresponding to X . This region is denoted F , ( f \in F ). The region of vector g (outside the region F ) also corresponds to Y and is denoted as G , ( g \in G ). In CT image reconstruction, it has C = 0 To simplify the concept of interior reconstruction, the matrices A , B , C , D are applied to image reconstruction instead of a complex operator.

The response in the outside region can be a guess G ; for example, assume it is g_{ex} \begin{bmatrix} x_0 \\ y_0 \end{bmatrix}= \begin{bmatrix} A & B \\ C & D \end{bmatrix}^{-1} \begin{bmatrix} f \\ g_{ex} \end{bmatrix} A solution of x is written as x_0 , and is known as the extrapolation method. The result depends on how good the extrapolation function g_{ex} is.

A frequent choice is g_{ex}|_{\partial G}=f |_{\partial F} at the boundary of the two regions. The extrapolation method is often combined with a priori knowledge, and an extrapolation method which reduces calculation time is shown below. g_1 = C x_0+D y_0 The reconstructed image can be calculated as follows: \begin{bmatrix} x_1 \\ y_1 \end{bmatrix}= \begin{bmatrix} A & B \\ C & D \end{bmatrix}^{-1} \begin{bmatrix} f \\ g_1+g_{1ex} \end{bmatrix} It is assumed that f |_{\partial F}=(g_1+g_{1ex})|_{\partial G} at the boundary of the interior region; x_1 solves the problem, and is known as the adaptive extrapolation method. g_{1ex} is the adaptive extrapolation function. \end{bmatrix}= \begin{bmatrix} A & B \\ C & D \end{bmatrix} \begin{bmatrix} 0 \\ y_0 \end{bmatrix} or f_1=B y_0 The reconstruction can be obtained as \begin{bmatrix} x_1 \\ y_1 \end{bmatrix}= \begin{bmatrix} A & B \\ C & D \end{bmatrix}^{-1} \begin{bmatrix} f - f_1 \\ g_{ex} \end{bmatrix} Here g_{1ex} is an extrapolation function, and it is assumed that (f-f_1)|_{\partial F}=g_{1ex}|_{\partial G} x_1 is one solution of this problem. f = A x + B y Consider the generalized inverse B^+ satisfying B B^+ B = B Define Q=[I-BB^+] so that QB = 0 Hence, Q f = Q A x The above equation can be solved as x_1 = A^+ Q^+ Q f , considering that QQ = Q QQQ = Q Q is the generalized inverse of Q , i.e. Q^+ = Q The solution can be simplified as x_1 = A^+ Q f . The matrix A^+Q = A^+ [I-BB^+] is known as the local inverse of matrix {\begin{bmatrix} A & B \\ C & D \\ \end{bmatrix}} , corresponding to A . This is known as the local inverse method. \end{bmatrix}= \begin{bmatrix} A & B \\ C & D \end{bmatrix}^{-1} \begin{bmatrix} f \\ g \end{bmatrix} and f is known, where R , S and T are weighting constants of the minimization and \|\cdot\| is some kind of norm.

Often-used norms are L_0 , L_1 , L_2 , L_{+\infty} total variation (TV) norm or a combination of the above norms. An example of this method is the projection onto convex sets (POCS) method.

Analytical solution

In special situations, the interior reconstruction can be obtained as an analytical solution; the solution of x is exact in such cases.

Fast extrapolation

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.

Comparison of methods

The extrapolation method is suitable in a situation where |x| > |y| and |X| > |Y| i.e. a small truncation artifacts situation. The adaptive extrapolation method is suitable for a situation where |x| \sim |y| and |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| and |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| and |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| ) in the reconstruction.

The local inverse method, identical to local tomography, suitable in a situation in which |x| \ll |y| and |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| ) in the reconstruction which may be smaller than with local tomography.

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.

See also

Forecasting Minimum polynomial extrapolation Multigrid method Prediction interval Regression analysis Richardson extrapolation Static analysis Trend estimation Interpolation Extrapolation domain analysis Dead reckoning Image reconstruction Local inverse Generalized inverse Extrapolation

Text derived from https://en.wikipedia.org/w/index.php?oldid=1361712987 under CC BY-SA 4.0; modifications have been made.

Words in each sectionMethodsMethodsMethods: 901 words901Comparison of methodsComparison of methodsComparison of methods: 261 words261Fast extrapolationFast extrapolationFast extrapolation: 97 words97See alsoSee alsoSee also: 50 words50Analytical solutionAnalytical solutionAnalytical solution: 22 words22
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001361712987 · captured 2026-06-29 · ledger · version history

Cite this page as: encyclopegia.org, “Interior reconstruction”, snapshot enwiki-001361712987. https://encyclopegia.org/a/interior-reconstruction

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.