Edge Detection from Non-Uniform Fourier Data Using the Convolutional Gridding Algorithm
- 300 Downloads
- 2 Citations
Abstract
Detecting edges in images from a finite sampling of Fourier data is important in a variety of applications. For example, internal edge information can be used to identify tissue boundaries of the brain in a magnetic resonance imaging (MRI) scan, which is an essential part of clinical diagnosis. Likewise, it can also be used to identify targets from synthetic aperture radar data. Edge information is also critical in determining regions of smoothness so that high resolution reconstruction algorithms, i.e. those that do not “smear over” the internal boundaries of an image, can be applied. In some applications, such as MRI, the sampling patterns may be designed to oversample the low frequency while more sparsely sampling the high frequency modes. This type of non-uniform sampling creates additional difficulties in processing the image. In particular, there is no fast reconstruction algorithm, since the FFT is not applicable. However, interpolating such highly non-uniform Fourier data to the uniform coefficients (so that the FFT can be employed) may introduce large errors in the high frequency modes, which is especially problematic for edge detection. Convolutional gridding, also referred to as the non-uniform FFT, is a forward method that uses a convolution process to obtain uniform Fourier data so that the FFT can be directly applied to recover the underlying image. Carefully chosen parameters ensure that the algorithm retains accuracy in the high frequency coefficients. Similarly, the convolutional gridding edge detection algorithm developed in this paper provides an efficient and robust way to calculate edges. We demonstrate our technique in one and two dimensional examples.
Keywords
Edge detection Fourier data Convolutional gridding Non-uniform fast Fourier transformReferences
- 1.Adcock, B., Gataric, M., Hansen, A.C.: On stable reconstructions from univariate non-uniform fourier measurements (2013). arXiv:1310.7820
- 2.Archibald, R., Chen, K., Gelb, A., Renaut, R.: Improving tissue segmentation of human brain MRI through pre-processing by the Gegenbauer reconstruction method. NeuroImage 20(1), 489–502 (2003)Google Scholar
- 3.Archibald, R., Gelb, A.: A method to reduce the Gibbs ringing artifact in mri scans while keeping tissue boundary integrity. IEEE Med. Imaging 21(4), 305–319 (2002)Google Scholar
- 4.Canny, J.: A computational approach to edge detection. IEEE Trans. Pattern Anal. Mach. Intell. 8, 678–698 (1986)Google Scholar
- 5.Christensen, O.: An introduction to frames and Riesz bases. In: Applied and Numerical Harmonic Analysis. Birkhäuser Boston Inc., Boston (2003)Google Scholar
- 6.Fessler, J., Sutton, B.: Nonuniform fast Fourier transforms using min-max interpolation. IEEE Trans. Sig. Proc. 51, 560–574 (2003)MathSciNetCrossRefGoogle Scholar
- 7.Forsyth, D., Ponce, J.: Computer Vision: A Modern Approach. Prentice Hall, Englewood Cliffs (2003)Google Scholar
- 8.Gelb, A., Cates, D.: Segmentation of images from Fourier spectral data. Commun. Comput. Phys. 5, 326–349 (2009)Google Scholar
- 9.Gelb, A., Song, G.: A frame theoretic approach to the non-uniform fast Fourier transform. SINUM (2014, in press)Google Scholar
- 10.Gelb, A., Tadmor, E.: Detection of edges in spectral data ii. nonlinear enhancement. SIAM J. Numer. Anal. 38, 1389–1408Google Scholar
- 11.Gelb, A., Tadmor, E.: Adaptive edge detectors for piecewise smooth data based on the minmod limiter. J. Sci. Comput. 28(2–3), 279–306 (2006)MathSciNetCrossRefMATHGoogle Scholar
- 12.Gelb, A., Tanner, J.: Robust reprojection methods for the resolution of the Gibbs phenomenon. Appl. Comput. Harmon. Anal. 20, 3–25 (2006)MathSciNetCrossRefMATHGoogle Scholar
- 13.Gelb, A., Hines, T.: Detection of edges from nonuniform Fourier data. J. Fourier Anal. Appl. 17, 1152–1179 (2011). doi: 10.1007/s00041-011-9172-7 MathSciNetCrossRefMATHGoogle Scholar
- 14.Gelb, A., Hines, T.: Recovering exponential accuracy from nonharmonic fourier data through spectral reprojection. J. Sci. Comput. 51(1), 158–182 (2012)MathSciNetCrossRefMATHGoogle Scholar
- 15.Gottlieb, D., Orszag, S.: Numerical Analysis of Spectral Methods: Theory and Applications, vol. 26. Society for Industrial and Applied Mathematics (1993)Google Scholar
- 16.Jackson, J., Meyer, C., Nishimura, D., Macovski, A.: Selection of a convolution function for Fourier inversion using gridding [computerised tomography application]. IEEE Trans. Med. Imaging 10(3), 473–478 (1991)CrossRefGoogle Scholar
- 17.O’Sullivan, J.: A fast sinc function gridding algorithm for Fourier inversion in computer tomography. IEEE Trans. Med. Imaging 4(4), 200–207 (1985)CrossRefGoogle Scholar
- 18.Petersen, A., Gelb, A., Eubank, R.: Hypothesis testing for fourier based edge detection methods. J. Sci. Comput. 51, 608–630 (2012)MathSciNetCrossRefMATHGoogle Scholar
- 19.Pipe, J.G., Menon, P.: Sampling density compensation in MRI: rationale and an iterative numerical solution. Magn. Reson. Med. 41(1), 179–186 (1999)CrossRefGoogle Scholar
- 20.Platte, R., Gelb, A.: A hybrid Fourier-Chebyshev method for partial differential equations. J. Sci. Comput. 39, 244–264 (2009)MathSciNetCrossRefMATHGoogle Scholar
- 21.Stefan, W., Viswanathan, A., Gelb, A., Renaut, R.: Sparsity enforcing edge detection method for blurred and noisy Fourier data. J. Sci. Comput. 50(3), 536–556 (2012)MathSciNetCrossRefMATHGoogle Scholar
- 22.Viswanathan, A.: Imaging from Fourier spectral data: problems in discontinuity detection, non-harmonic Fourier reconstruction and point-spread function estimation. PhD thesis, Arizona State University (2010)Google Scholar
- 23.Viswanathan, A., Gelb, A., Cochran, D., Renaut, R.: On reconstruction from non-uniform spectral data. J. Sci. Comp. 45(1–3), 487–513 (2010)MathSciNetCrossRefMATHGoogle Scholar