2004
DOI: 10.1002/mrm.10692
|View full text |Cite
|
Sign up to set email alerts
|

Iterative Next‐Neighbor Regridding (INNG): Improved reconstruction from nonuniformly sampled k‐space data using rescaled matrices

Abstract: The reconstruction of MR images from nonrectilinearly sampled data is complicated by the fact that the inverse 2D Fourier transform (FT) cannot be performed directly on the acquired k-space data set. k-Space gridding is commonly used because it is an efficient reconstruction method. However, conventional gridding requires optimized density compensation functions (DCFs) to avoid profile distortions. Oftentimes, the calculation of optimized DCFs presents an additional challenge in obtaining an accurately gridded… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2

Citation Types

0
24
0

Year Published

2004
2004
2015
2015

Publication Types

Select...
7
2

Relationship

1
8

Authors

Journals

citations
Cited by 23 publications
(24 citation statements)
references
References 27 publications
0
24
0
Order By: Relevance
“…Various regridding techniques have been studied in magnetic resonance imaging (MRI) when non-rectilinear data acquisition methods are used. These techniques include conventional regridding algorithms using convolution function [19,20], block uniform resampling (BURS) [21], next-neighbour regridding [22], and the more recent iterative next-neighbour regridding (INNG) [23]. In the present study, we adopted the INNG to regrid the radially sampled spectral data on a rectilinear grid.…”
Section: Regridding Of Radial Spectral Datamentioning
confidence: 99%
See 1 more Smart Citation
“…Various regridding techniques have been studied in magnetic resonance imaging (MRI) when non-rectilinear data acquisition methods are used. These techniques include conventional regridding algorithms using convolution function [19,20], block uniform resampling (BURS) [21], next-neighbour regridding [22], and the more recent iterative next-neighbour regridding (INNG) [23]. In the present study, we adopted the INNG to regrid the radially sampled spectral data on a rectilinear grid.…”
Section: Regridding Of Radial Spectral Datamentioning
confidence: 99%
“…In the present study, we adopted the INNG to regrid the radially sampled spectral data on a rectilinear grid. For details about INNG, readers are a referred to Moriguchi et al [23].…”
Section: Regridding Of Radial Spectral Datamentioning
confidence: 99%
“…However, the rearrangement of the coordinates is not performed when a projection reconstruction such as the filtered back-projection method is employed for image reconstruction [4,13]. Recently, iterative image reconstruction has been employed in radial MRI [14][15][16]. Iterative image reconstruction has an affinity for the radial scan, because it does not require rearrangement of k-space data.…”
Section: Introductionmentioning
confidence: 98%
“…!,, (x,y) are extracted as f x (x,y) for the next processing.Each iteration means that the resultant frequency spectrum matrix is the convolution of the one before zero replace step with a 20 sinc function to estimate the frequency spectrum. Please refer to[4] for more details.It should be mentioned that the INNG algorithm is self convergent. In step of matrix rescaling, the new location of each datum is determined by rounding off the product of the original k-space coordinate and rescaling factor.…”
mentioning
confidence: 99%