A gridding algorithm for efficient density compensation of arbitrarily sampled fourier-domain data
Uniformly sampled data is sometimes not directly available in engineering applications ranging from synthetic aperture radars to magnetic resonance imaging. However, certain signal processing techniques such as the fast Fourier transform cannot be applied to non-equispaced data. It is therefore desi...
| Main Authors: | , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
2005
|
| _version_ | 1797054762051436544 |
|---|---|
| author | Malik, W Khan, H Edwards, D Stevens, C |
| author_facet | Malik, W Khan, H Edwards, D Stevens, C |
| author_sort | Malik, W |
| collection | OXFORD |
| description | Uniformly sampled data is sometimes not directly available in engineering applications ranging from synthetic aperture radars to magnetic resonance imaging. However, certain signal processing techniques such as the fast Fourier transform cannot be applied to non-equispaced data. It is therefore desirable to resample the data on a regular grid. Various interpolation schemes have been proposed for this purpose, such as gridding reconstruction. A computationally expensive step in the gridding algorithm is the estimation of the data sampling density. This paper presents a method for improving both the efficiency and the quality of gridding density estimation based on partial Voronoi diagrams. It is shown that significantly higher computational efficiency is achieved by this method over the existing schemes. Lower spreading and greater sidelobe suppression of the point spread function demonstrate the superiority of the proposed reconstruction method. |
| first_indexed | 2024-03-06T19:01:47Z |
| format | Journal article |
| id | oxford-uuid:13cb2c08-775b-4122-9737-4592cca8da5f |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-06T19:01:47Z |
| publishDate | 2005 |
| record_format | dspace |
| spelling | oxford-uuid:13cb2c08-775b-4122-9737-4592cca8da5f2022-03-26T10:15:51ZA gridding algorithm for efficient density compensation of arbitrarily sampled fourier-domain dataJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:13cb2c08-775b-4122-9737-4592cca8da5fEnglishSymplectic Elements at Oxford2005Malik, WKhan, HEdwards, DStevens, CUniformly sampled data is sometimes not directly available in engineering applications ranging from synthetic aperture radars to magnetic resonance imaging. However, certain signal processing techniques such as the fast Fourier transform cannot be applied to non-equispaced data. It is therefore desirable to resample the data on a regular grid. Various interpolation schemes have been proposed for this purpose, such as gridding reconstruction. A computationally expensive step in the gridding algorithm is the estimation of the data sampling density. This paper presents a method for improving both the efficiency and the quality of gridding density estimation based on partial Voronoi diagrams. It is shown that significantly higher computational efficiency is achieved by this method over the existing schemes. Lower spreading and greater sidelobe suppression of the point spread function demonstrate the superiority of the proposed reconstruction method. |
| spellingShingle | Malik, W Khan, H Edwards, D Stevens, C A gridding algorithm for efficient density compensation of arbitrarily sampled fourier-domain data |
| title | A gridding algorithm for efficient density compensation of arbitrarily sampled fourier-domain data |
| title_full | A gridding algorithm for efficient density compensation of arbitrarily sampled fourier-domain data |
| title_fullStr | A gridding algorithm for efficient density compensation of arbitrarily sampled fourier-domain data |
| title_full_unstemmed | A gridding algorithm for efficient density compensation of arbitrarily sampled fourier-domain data |
| title_short | A gridding algorithm for efficient density compensation of arbitrarily sampled fourier-domain data |
| title_sort | gridding algorithm for efficient density compensation of arbitrarily sampled fourier domain data |
| work_keys_str_mv | AT malikw agriddingalgorithmforefficientdensitycompensationofarbitrarilysampledfourierdomaindata AT khanh agriddingalgorithmforefficientdensitycompensationofarbitrarilysampledfourierdomaindata AT edwardsd agriddingalgorithmforefficientdensitycompensationofarbitrarilysampledfourierdomaindata AT stevensc agriddingalgorithmforefficientdensitycompensationofarbitrarilysampledfourierdomaindata AT malikw griddingalgorithmforefficientdensitycompensationofarbitrarilysampledfourierdomaindata AT khanh griddingalgorithmforefficientdensitycompensationofarbitrarilysampledfourierdomaindata AT edwardsd griddingalgorithmforefficientdensitycompensationofarbitrarilysampledfourierdomaindata AT stevensc griddingalgorithmforefficientdensitycompensationofarbitrarilysampledfourierdomaindata |