148 research outputs found
Learning-based method for k-space trajectory design in MRI
No full textVariable density sampling of the k-space in MRI is an integral part of trajectory design. It has been observed that data-driven trajectory design methods provide a better image reconstruction as compared to trajectories obtained from a fixed or a parametric density function. In this paper, a data-driven strategy has been proposed to obtain non-Cartesian continuous k-space sampling trajectories for MRI under the compressed sensing framework (greedy non-Cartesian (GNC)). A stochas-tic version of the algorithm (stochastic greedy non-Cartesian (SGNC)) is also proposed that reduces the computation time. We compare the proposed trajectory with a traveling salesman problem (TSP)-based trajectory and an echo planar imaging-like trajectory obtained by a greedy method called stochastic greedy-Cartesian (SGC) algorithm. The training images are taken from knee images of the fastMRI dataset. It is observed that the proposed algorithms outperform the TSP-based and the SGC trajectories for similar read-out times.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Signal Processing System
K-Space Trajectory Design for Reduced MRI Scan Time
No full textThe development of compressed sensing (CS) techniques for magnetic resonance imaging (MRI) is enabling a speedup of MRI scanning. To increase the incoherence in the sampling, a random selection of points on the k-space is deployed and a continuous trajectory is obtained by solving a traveling salesman problem (TSP) through these points. A feasible trajectory satisfying the gradient constraints is then obtained by parameterizing it using state-of-the-art methods. In this paper, a constrained convex optimization based method to obtain feasible trajectories is proposed. The method is motivated by the fact that the readout time is proportional to the number of sample points and includes the lengths of the segments of the trajectory in the cost function to obtain variable length trajectories. The proposed method provides a reduction in readout time by more than 50% for random-like trajectories with an improvement of about 1.5 dB in peak signal-to-noise ratio (PSNR) and 0.0762 in structural similarity (SSIM) index on average for a realistic brain phantom MRI image adopting single-shot trajectories.Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Signal Processing System
Towards a general framework for fast and feasible k-space trajectories for MRI based on projection methods
No full textThe 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.Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Signal Processing System
Space Filling Curves for MRI Sampling
No full textA novel class of k-space trajectories for magnetic resonance imaging (MRI) sampling using space filling curves (SFCs) is presented here. More specifically, Peano, Hilbert and Sierpinski curves are used. We propose 1-shot and 4-shot variable density SFCs by utilizing the space coverage provided by SFCs in different iterations. The proposed trajectories are compared with state-of-the-art echo planar imaging (EPI) trajectories for 128 × 128 and 256 × 256 phantom and brain images. The simulation results show that the readout time is reduced by up to 45% for the 128 × 128 image with little compromise in reconstruction quality. Also, the peak signal-to-noise ratio (PSNR) and structural similarity (SSIM) index are improved by 2.32 dB and 0.1009, respectively, with an 18% shorter readout time using the 4-shot Hilbert SFC trajectory for reconstructing a 256 × 256 brain MRI image.Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Signal Processing System
Unique synthesis of isochromenoindolone <em>via</em> reductive-oxidative cyclisation approach</span>
No full text104-108A unique reductive-oxidative cyclisation approach for synthesis of isochromeno[4,3-b]indol-5(11H)-one from nitrostrylbenzoate is described
ChemInform Abstract: Synthesis of 6H‐Isoindolo[2,1‐α]indol‐6‐ones Through Wittig Reaction and Tandem Reductive Cyclization—Lactamization.
No full text- …
