Related Experiment Video
Updated: May 3, 2026
05:05
Four-Dimensional CT Analysis Using Sequential 3D-3D Registration
Published on: November 23, 2019
7.6K
Dynamic CT reconstruction by smoothed rank minimization.
Angshul Majumdar1, Rabab K Ward2
1Indraprastha Institute of Information Technology, Delhi. angshul@iiitd.ac.in
Medical Image Computing and Computer-Assisted Intervention : MICCAI ... International Conference on Medical Image Computing and Computer-Assisted Intervention
|February 8, 2014
Summary
This study introduces a new method for dynamic computed tomography (CT) reconstruction using low-rank matrix modeling. The approach significantly improves CT image reconstruction accuracy from limited data.
Area of Science:
- Medical Imaging
- Computational Imaging
- Image Reconstruction
Background:
- Dynamic CT reconstruction from undersampled data is challenging.
- Temporal correlations in dynamic CT sequences can be exploited.
Purpose of the Study:
- To develop a novel low-rank matrix recovery method for dynamic CT reconstruction.
- To improve reconstruction accuracy from parsimoniously sampled sinograms.
Main Methods:
- Modeling dynamic CT sequences as low-rank matrices.
- Applying a novel algorithm for low-rank matrix recovery.
- Reconstructing CT matrices from undersampled sinograms.
Main Results:
- The proposed method models dynamic CT as a low-rank matrix.
- Achieved over 50% reduction in reconstruction error compared to prior techniques.
- Successfully reconstructed dynamic CT from parsimoniously sampled sinograms.
Conclusions:
- Low-rank matrix modeling is effective for dynamic CT reconstruction.
- The novel algorithm offers significant improvements in accuracy and efficiency.
- This method advances sparse-data CT imaging.
Related Concept Videos
01:29Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
438
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
438
01:10Reconstruction of Signal using Interpolation
920
Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next...
920
01:24One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
1.5K
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
On...
1.5K
01:26Linearization and Approximation
233
Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
233