Sparse-Coding-Based Computed Tomography Image Reconstruction
Sang Min Yoon,Gangjoon Yoon +1 more
TL;DR: This work proposes a medical image reconstruction methodology using the properties of sparse coding, a very powerful matrix factorization method which each pixel point is represented as a linear combination of a small number of basis vectors.
read more
Abstract: Computed tomography (CT) is a popular type of medical imaging that generates images of the internal structure of an object based on projection scans of the object from several angles. There are numerous methods to reconstruct the original shape of the target object from scans, but they are still dependent on the number of angles and iterations. To overcome the drawbacks of iterative reconstruction approaches like the algebraic reconstruction technique (ART), while the recovery is slightly impacted from a random noise (small amount of l2 norm error) and projection scans (small amount of l1 norm error) as well, we propose a medical image reconstruction methodology using the properties of sparse coding. It is a very powerful matrix factorization method which each pixel point is represented as a linear combination of a small number of basis vectors.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
A Hybrid Iterative Algorithm For Reconstruction Of X-Ray Computed Tomography
TL;DR: A hybrid iterative algorithm by combining multigrid method, Tikhonov regularization and Simultaneous Iterative Reconstruction Technique for reconstruction of the computed tomography image that reduces the time and the volume of computations considerably.
2
References
Regularization and variable selection via the elastic net
Hui Zou,Trevor Hastie +1 more
TL;DR: It is shown that the elastic net often outperforms the lasso, while enjoying a similar sparsity of representation, and an algorithm called LARS‐EN is proposed for computing elastic net regularization paths efficiently, much like algorithm LARS does for the lamba.
•Posted Content
Compressed Sensing: Theory and Applications
Gitta Kutyniok
- 15 Mar 2012
TL;DR: Machine generated contents note: Introduction to compressed sensing Mark A. Davenport, Marco F. Duarte, Yonina C. Eldar, Pier Luigi Dragotta and Zvika Ben-Haim.
9.7K
Decoding by linear programming
Emmanuel J. Candès,Terence Tao +1 more
TL;DR: F can be recovered exactly by solving a simple convex optimization problem (which one can recast as a linear program) and numerical experiments suggest that this recovery procedure works unreasonably well; f is recovered exactly even in situations where a significant fraction of the output is corrupted.
Stable signal recovery from incomplete and inaccurate measurements
TL;DR: In this paper, the authors considered the problem of recovering a vector x ∈ R^m from incomplete and contaminated observations y = Ax ∈ e + e, where e is an error term.
•Posted Content
Stable Signal Recovery from Incomplete and Inaccurate Measurements
TL;DR: It is shown that it is possible to recover x0 accurately based on the data y from incomplete and contaminated observations.