Comparison of Algorithms for Compressed Sensing of Magnetic Resonance Images
원문 초록
Magnetic resonance imaging (MRI) is an essential medical tool with inherently slow data acquisition process. Slow acquisition process requires patient to be long time exposed to scanning apparatus. In recent years significant efforts are made towards the applying Compressive Sensing technique to the acquisition process of MRI and biomedical images. Compressive Sensing is an emerging theory in signal processing. It aims to reduce the amount of acquired data required for successful signal reconstruction. Reducing the amount of acquired image coefficients leads to lower acquisition time, i.e. time of exposition to the MRI apparatus. Using optimization algorithms, satisfactory image quality can be obtained from the small set of acquired samples. A number of optimization algorithms for the reconstruction of the biomedical images is proposed in the literature. In this paper, three commonly used optimization algorithms are compared and results are presented on the several MRI images.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Group Sparsity Methods for Compressive Space-Frequency Channel Estimation and Spatial Equalization in Fluid Antenna System
A Hierarchical View of Structured Sparsity in Kronecker Compressive Sensing
Subspace Constrained Variational Bayesian Inference for Structured Compressive Sensing with a Dynamic Grid
CMAR-Net: Accurate Cross-Modal 3D SAR Reconstruction of Vehicle Targets with Sparse-Aspect Multi-Baseline Data
Compression Ratio Learning and Semantic Communications for Video Imaging
Fractal Compressive Sensing
토론
이 논문과 연결된 포럼 글이 아직 없습니다.