Imaging fields of MRI, CT, radar are using algorithms referred to as non-uniform FFT, to make fast Fourier transforms (in 1,2 and 3 dimension) of data on non-regular sampling grids. This problem in radio astronomy was solved by using the technique of convolution gridding. With increasing numbers using and developing the NUFFT algorithms, might this be more effective technique than convolution gridding, for aperture synthesis imaging?
Groups developing NUFFT algorithms (so far I've identified are) at Berkeley, NYU, Michigan and Chemnitz, offer downloadable codes to run their algorithms, offering codes in a range of languages, including Matlab with mex functions for C programs. Might any known how good/easy these codes might be to implement, to do the equivalent of convolution gridding? Or perhaps might there be better algorithms from elsewhere? Neil Salmon "Before acting on this email or opening any attachments you should read the Manchester Metropolitan University email disclaimer available on its website http://www.mmu.ac.uk/emaildisclaimer " -- You received this message because you are subscribed to the Google Groups "[email protected]" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected].
