2023
DOI: 10.22541/au.167655859.96254660/v2
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Sampling Technique for Fourier Convolution Theorem Based k-space Filtering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
13
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(13 citation statements)
references
References 0 publications
0
13
0
Order By: Relevance
“…Table I in [14] shows the computer programs implementing the filters. For each convolving function, table II in [14] shows the number of runs used to verify the sampling technique for k‐space filtering. The data set comprises 30 magnetic resonance imaging (MRI) images (see Table II in [14]).…”
Section: Resultsmentioning
confidence: 99%
See 4 more Smart Citations
“…Table I in [14] shows the computer programs implementing the filters. For each convolving function, table II in [14] shows the number of runs used to verify the sampling technique for k‐space filtering. The data set comprises 30 magnetic resonance imaging (MRI) images (see Table II in [14]).…”
Section: Resultsmentioning
confidence: 99%
“…For each convolving function, table II in [14] shows the number of runs used to verify the sampling technique for k‐space filtering. The data set comprises 30 magnetic resonance imaging (MRI) images (see Table II in [14]). This number is inclusive of the number of images that were filtered by at least one (or more) of the 15 filters used in this paper (4 proposed, 10 used for comparison, and the elliptical filter).…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations