Dynamic CT reconstruction by smoothed rank minimization

0Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We address the problem of dynamic CT reconstruction from parsimoniously sampled sinograms. In this paper we propose a novel approach to solve the aforesaid problem by modeling the dynamic CT sequence as a lowrank matrix. This dynamic CT matrix is formed by stacking each frame as a column of the matrix. As these images are temporally correlated, the dynamic CT matrix would therefore be of low-rank as its columns are not independent. We exploit the low-rank information to reconstruct the CT matrix from its parsimoniously sampled sinograms. Mathematically this is a low-rank matrix recovery problem, and we propose a novel algorithm to solve it. Our proposed method reduces the reconstruction error by 50% or more when compared to previous recovery techniques.

Cite

CITATION STYLE

APA

Majumdar, A., & Ward, R. K. (2013). Dynamic CT reconstruction by smoothed rank minimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8151, pp. 131–138). Springer Verlag. https://doi.org/10.1007/978-3-642-40760-4_17

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free