Anne Gelb
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Anne Gelb has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Guohui Song
Department of Mathematics Clarkson University 13699 Potsdam NY
2 shared publications - Rick Archibald
Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
2 shared publications - Rosemary Anne Renaut
School of Mathematical and Statistical Sciences, Arizona State University, Tempe, USA
2 shared publications - A. Petersen
Arizona State University
1 shared publication - Adityavikram Viswanathan
California Institute of Technology
1 shared publication - Carl L. Gardner
Arizona State University
1 shared publication
Latest Publications
- Open Access
A Two-dimensional Inverse Frame Operator Approximation Technique
The ability to efficiently and accurately construct an inverse frame operator is critical for establishing the utility of numerical frame approximations. Recently, the admissible frame method was developed to approximate inverse frame operators for one-dimensional problems. Using the admissible frame approach, it is possible to project the corresponding frame data onto a more suitable (admissible) frame, even when the sampling frame is only weakly localized. As a result, a target function may be approximated as a finite frame expansion with its asymptotic convergence solely dependent on its smoothness. In this investigation, we seek to expand the admissible frame approach to two dimensions, which requires some additional constraints. We prove that the admissible frame technique converges in two dimensions and then demonstrate its usefulness with some numerical experiments that use sampling patterns inspired by applications that sample data non-uniformly in the Fourier domain.
Open AccessA Two-dimensional Inverse Frame Operator Approximation Technique
The ability to efficiently and accurately construct an inverse frame operator is critical for establishing the utility of numerical frame approximations. Recently, the admissible frame method was developed to approximate inverse frame operators for one-dimensional problems. Using the admissible frame approach, it is possible to project the corresponding frame data onto a more suitable (admissible) frame, even when the sampling frame is only weakly localized. As a result, a target function may be approximated as a finite frame expansion with its asymptotic convergence solely dependent on its smoothness. In this investigation, we seek to expand the admissible frame approach to two dimensions, which requires some additional constraints. We prove that the admissible frame technique converges in two dimensions and then demonstrate its usefulness with some numerical experiments that use sampling patterns inspired by applications that sample data non-uniformly in the Fourier domain.
- 18 December 2014
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 65 (2) , 533-552
Image Reconstruction from Fourier Data Using Sparsity of Edges
- 18 December 2014
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 65 (2) , 533-552
Image Reconstruction from Fourier Data Using Sparsity of Edges
- Open Access
A frame theoretic approach to the Non-Uniform Fast Fourier Transform
Nonuniform Fourier data are routinely collected in applications such as magnetic resonance imaging, synthetic aperture radar, and synthetic imaging in radio astronomy. To acquire a fast reconstruction that does not require an online inverse process, the non-uniform fast Fourier transform (NFFT), also called convolutional gridding, is frequently employed. While various investigations have led to improvements in accuracy, efficiency, and robustness of the NFFT, not much attention has been paid to the fundamental analysis of the scheme, and in particular its convergence properties. This paper analyzes the convergence of the NFFT by casting it as a Fourier frame approximation. In so doing, we are able to design parameters for the method that satisfy conditions for numerical convergence. Our so called frame theoretic convolutional gridding algorithm can also be applied to detect features (such as edges) from non-uniform Fourier samples of piecewise smooth functions.
Open AccessA frame theoretic approach to the Non-Uniform Fast Fourier Transform
Nonuniform Fourier data are routinely collected in applications such as magnetic resonance imaging, synthetic aperture radar, and synthetic imaging in radio astronomy. To acquire a fast reconstruction that does not require an online inverse process, the non-uniform fast Fourier transform (NFFT), also called convolutional gridding, is frequently employed. While various investigations have led to improvements in accuracy, efficiency, and robustness of the NFFT, not much attention has been paid to the fundamental analysis of the scheme, and in particular its convergence properties. This paper analyzes the convergence of the NFFT by casting it as a Fourier frame approximation. In so doing, we are able to design parameters for the method that satisfy conditions for numerical convergence. Our so called frame theoretic convolutional gridding algorithm can also be applied to detect features (such as edges) from non-uniform Fourier samples of piecewise smooth functions.
- 1 July 2013
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 35 (1) , 94-110
Approximating the inverse frame operator from localized frames
- 1 July 2013
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 35 (1) , 94-110
Approximating the inverse frame operator from localized frames
- Open Access
Approximating the Inverse Frame Operator from Localized Frames
This investigation seeks to establish the practicality of numerical frame approximations. Specifically, it develops a new method to approximate the inverse frame operator and analyzes its convergence properties. It is established that sampling with {\em well-localized frames} improves both the accuracy of the numerical frame approximation as well as the robustness and efficiency of the (finite) frame operator inversion. Moreover, in applications such as magnetic resonance imaging, where the given data often may not constitute a well-localized frame, a technique is devised to project the corresponding frame data onto a more suitable frame. As a result, the target function may be approximated as a finite expansion with its asymptotic convergence solely dependent on its smoothness. Numerical examples are provided.
Open AccessApproximating the Inverse Frame Operator from Localized Frames
This investigation seeks to establish the practicality of numerical frame approximations. Specifically, it develops a new method to approximate the inverse frame operator and analyzes its convergence properties. It is established that sampling with {\em well-localized frames} improves both the accuracy of the numerical frame approximation as well as the robustness and efficiency of the (finite) frame operator inversion. Moreover, in applications such as magnetic resonance imaging, where the given data often may not constitute a well-localized frame, a technique is devised to project the corresponding frame data onto a more suitable frame. As a result, the target function may be approximated as a finite expansion with its asymptotic convergence solely dependent on its smoothness. Numerical examples are provided.
- 18 January 2012
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 50 (3) , 493-494
Special Issue on Mathematical Methods in Medical Imaging
- 18 January 2012
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 50 (3) , 493-494
Special Issue on Mathematical Methods in Medical Imaging
- 17 December 2011
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 38 (4) , 737-762
Edge detection from truncated Fourier data using spectral mollifiers
- 17 December 2011
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 38 (4) , 737-762
Edge detection from truncated Fourier data using spectral mollifiers
- 22 September 2011
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 50 (3) , 536-556
Sparsity Enforcing Edge Detection Method for Blurred and Noisy Fourier data
- 22 September 2011
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 50 (3) , 536-556
Sparsity Enforcing Edge Detection Method for Blurred and Noisy Fourier data
- 2 September 2011
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 51 (3) , 608-630
Hypothesis Testing for Fourier Based Edge Detection Methods
- 2 September 2011
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 51 (3) , 608-630
Hypothesis Testing for Fourier Based Edge Detection Methods
- 22 June 2011
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 51 (1) , 158-182
Recovering Exponential Accuracy from Non-harmonic Fourier Data Through Spectral Reprojection
- 22 June 2011
- Published by Springer Nature in Journal of Scientific Computing
- Vol. 51 (1) , 158-182
Recovering Exponential Accuracy from Non-harmonic Fourier Data Through Spectral Reprojection