Nested Iterative Reconstruction for CT Image Quality

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Iterative reconstruction algorithms in CT imaging require significant computation time and resources due to the high number of iterations needed to achieve image reconstruction, which is inefficient compared to conventional methods.

Innovation Solution

A nested iteration loop framework is implemented, where an inner loop iteratively optimizes a second objective function to accelerate the convergence of the outer loop, reducing the overall computational complexity and time required for image reconstruction.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If conventional iterative reconstruction algorithms (OSEM, PCG, ICD) are used to optimize the objective function, then image reconstruction quality is improved, but the number of iterations required increases significantly, leading to longer computation time

Engineering Contradiction:
Improveimage reconstruction qualityVSAvoidcomputation time
Core Design Contradiction:
Measurement precisionVSLoss of time

Solution Approach 1:

The optimization process is segmented into two distinct loops: an inner loop that performs multiple iterations to compute an approximate solution, and an outer loop that performs fewer iterations using the inner loop's results. This segmentation allows the computationally intensive inner loop to be executed multiple times without proportionally increasing the outer loop's iteration count, thereby reducing overall computation time while maintaining reconstruction quality.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The inner loop is nested within the outer loop, where the inner loop's optimization results are fed back into the outer loop for further optimization. This nested structure enables efficient use of computational resources by allowing the inner loop to pre-compute approximations that accelerate the outer loop's convergence, reducing the total number of iterations needed compared to conventional single-loop methods.

Inventive Principle:
Principle #7Nested doll (Nesting)

2Manufacturing precision

If a high number of iterations is used to achieve accurate image reconstruction, then reconstruction accuracy is improved, but computational resources and time consumption increase significantly

Engineering Contradiction:
Improvereconstruction accuracyVSAvoidcomputational efficiency
Core Design Contradiction:
Manufacturing precisionVSProductivity

Solution Approach 1:

The inner loop performs preliminary optimization actions by iteratively solving the objective function multiple times to generate an approximate solution before the outer loop begins. This preliminary action prepares the optimization process in advance, providing a good initial estimate that reduces the number of outer loop iterations needed to achieve final convergence, thereby improving computational efficiency while maintaining accuracy.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The outer loop uses feedback from the inner loop's optimization results to guide further optimization. The inner loop's approximate solution is fed back into the outer loop as an initial guess or starting point, which accelerates convergence. This feedback mechanism ensures that the outer loop does not need to perform as many iterations as conventional methods, improving productivity while preserving reconstruction accuracy.

Inventive Principle:
Principle #23Feedback

Data Source

PatentUS9020230B2Method and apparatus for iterative reconstruction
Publication Date: 2015.04.28 GENERAL ELECTRIC CO
  • US9020230B2 patent drawing
  • US9020230B2 patent drawing
  • US9020230B2 patent drawing

AI summary

A method for reconstructing an image of an object that includes a plurality of image elements. The method includes accessing image data associated with a plurality of image elements, and reconstructing an image of the object by optimizing an objective function, where the objective function is optimized by iteratively solving a nested sequence of approximate optimization problems. The algorithm is composed of nested iterative loops, in which an inner loop iteratively optimizes an objective function approximating the outer loop objective function, and an outer loop that utilizes the solution of the inner loop to optimize the original objective function.