Você está na página 1de 17

Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

Constructing Weighting Coecients for Convolutional Gridding


Sean Walker
Arizona State University CSUMS

June 29, 2012

Motivation
Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

In order to allow for the use of nonuniform Fourier data in the reconstruction of a signal, convolutional regridding can be applied. I wanted to examine the eect of dierent methods of generating weighting coecients on the accuracy of the reconstruction under various operating conditions.

Background
Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

We are given f (k ), some nonuniform Fourier data. The data may be given as either jittered sampling, k = k k , k [0, 1 ], in which data is randomly moved from 4 integer locations by a small amount, or it may be logarithmic sampling, with most of the data concentrated at lower frequencies. We seek to reconstruct the signal f (x) from f (). Because of the possibility of k = k, we cannot use FFT. In addition, gridding will introduce a resampling error as we convert f (k ) f (k). Nonperiodic functions will also suer from Gibbs oscillations. We want to solve these issues by using convolutional gridding.

Choosing Phi
Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

We seek to choose a window function fullling a few useful properties. We want to have compact support to reduce aliasing, and we want to be compactly supported to ensure computational eciency. Since it is impossible to have compact support on both the physical and spectral domains, we use a function such that is nearly zero for large and is nearly zero for x [, ]. / We also want () to have a closed form, to avoid expensive calculations later on. This leads to the choice of = e a|x|

Finding Alpha
Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

We are reconstructing

f =

f ()e ix d

N N

f ()e ix d
k=N

k f e ik x k

with f our data, k our frequency locations, and k our weighting coecients. Our initial work looked at using quadrature of to determine as a density factor. This produced useful results, but recent work in solving a least-squares approximation can provide even greater accuracy.

The Optimal Alpha


Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

In order to make optimal, we want to make it close to the inverse frame operator. If we set fcg = |k|m ck k , c = f with = (l k ) and = diag(k ), and we set ffrm = |k|m dk k with d = f , = j , l then we want to minimize c d = ( )f = ( ( )1 )f = ( )1 ( I )f so we want to minimize || I ||F . Then if we set T = , D = and
Tj,k =
L

j,L L,k =
L

j , L (Lk ) =
L

1 (Lj )(Lk )

Solving with Least Squares


Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

Let Tj,k =
L

1 (L j )(L k )

This is an interpolation matrix such that the kth column consists of our samples of the interpolating kernel centered at the kth grid point. Then we want to nd D such that TD I , the identity matrix. This is equivalent to minimizing ||k Tk ek ||
2

for Tk the kth column of T and ek the kth column of I. This has a closed form of
T T k = (Tk Tk )1 Tk ek

which is the left-sided psuedoinverse of T , multiplied by ek .

p-banding
Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

By generalizing D from a regular diagonal matrix of to a p-banded one, we can increase the accuracy further. This is simply done by minimizing ||Tk Dk ek ||
2

and using the coecients of D for reconstruction.

Legend
Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

Black is the original function that is being reconstructed. Red is the reconstruction using weighting factors based on quadrature with the trapezoid rule. Green is the reconstruction using weighting factors based on diagonal least squares. Blue is the reconstruction using weighting factors based on 3-banded diagonal least squares. The top image shows the reconstructions with the original function. The bottom image shows the log error of the reconstructions.

Jittered 128 points


Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

Jittered 256 points


Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

Logarithmic 128 points


Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

Piecewise function Jittered 128 points


Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

Piecewise function Logarithmic 128 points


Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

Expanding Further
Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

In the future, we will examine adding an 1 constraint to the least squares term, as a way of incorporating edge information into the minimization. We will also apply techniques to resolve the Gibbs phenomenon for piecewise smooth functions.

Thanks
Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

I would like to thank Dr. Gelb and Dr. Song for help with the project, and CSUMS and the NSF for funding this research.

More Information
Constructing Weighting Coecients for Convolutional Gridding Sean Walker Motivation Methodology Results Future Work

For additional information on this topic, please consult: Imaging from Fourier Spectral Data by Aditya Viswanathan On the Optimality of the Gridding Reconstruction Algorithm by H. Sedarat and D. Nishimura

Você também pode gostar