ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Towards a general framework for fast and feasible k-space trajectories for MRI based on projection methods

Sharma, S and Coutino, M and Chepuri, SP and Leus, G and Hari, KVS (2020) Towards a general framework for fast and feasible k-space trajectories for MRI based on projection methods. In: Magnetic Resonance Imaging, 72 . pp. 122-134.

[img]
Preview
PDF
mag_res_ima_72_122-134_2020.pdf - Published Version

Download (10MB) | Preview
Official URL: https://doi.org/10.1016/j.mri.2020.06.016

Abstract

The design of feasible trajectories to traverse the k-space for sampling in magnetic resonance imaging (MRI) is important while considering ways to reduce the scan time. Over the recent years, non-Cartesian trajectories have been observed to result in benign artifacts and being less sensitive to motion. In this paper, we propose a generalized framework that encompasses projection-based methods to generate feasible non-Cartesian k-space trajectories. This framework allows to construct feasible trajectories from both random or structured initial trajectories, e.g., based on the traveling salesman problem (TSP). We evaluate the performance of the proposed methods by simulating the reconstruction of 128 × 128 and 256 × 256 phantom and brain MRI images in terms of structural similarity (SSIM) index and peak signal-to-noise ratio (PSNR) using compressed sensing techniques. It is observed that the TSP-based trajectories from the proposed projection method with constant acceleration parameterization (CAP) result in better reconstruction compared to the projection method with constant velocity parameterization (CVP) and this for a similar read-out time. Further, random-like trajectories are observed to be better than TSP-based trajectories as they reduce the read-out time while providing better reconstruction quality. A reduction in read-out time by upto 67% is achieved using the proposed projection with permutation (PP) method. © 2020 Elsevier Inc.

Item Type: Journal Article
Publication: Magnetic Resonance Imaging
Publisher: Elsevier Inc.
Additional Information: The copyright for this article belongs to The Authors.
Keywords: algorithm; Article; constant acceleration parameterization; constant velocity parameterization; constrained length trajectory; controlled study; image reconstruction; intermethod comparison; mathematical analysis; mathematical parameters; nuclear magnetic resonance imaging; peak signal to noise ratio; priority journal; projection with permutation; simulation; spline interpolation based projection; structural similarity index measure; traveling salesman problem; artifact; brain; diagnostic imaging; feasibility study; human; image processing; imaging phantom; procedures; signal noise ratio, Algorithms; Artifacts; Brain; Feasibility Studies; Humans; Image Processing, Computer-Assisted; Magnetic Resonance Imaging; Phantoms, Imaging; Signal-To-Noise Ratio
Department/Centre: Division of Electrical Sciences > Electrical Communication Engineering
Date Deposited: 12 Jan 2023 09:30
Last Modified: 12 Jan 2023 09:30
URI: https://eprints.iisc.ac.in/id/eprint/79065

Actions (login required)

View Item View Item