Incorporating the Sparsity of Edges into the Fourier Reconstruction of Piecewise Smooth Functions In applications such as Magnetic Resonance Imaging (MRI), data are acquired as Fourier samples. Since the underlying images are only piecewise smooth, standard recon- struction techniques will yield the Gibbs phenomenon, which can lead to misdiagnosis. Although filtering will reduce the oscillations at jump locations, it can often have the adverse effect of blurring at these critical junctures, which can also lead to misdiagno- sis. Incorporating prior information into reconstruction methods can help reconstruct a sharper solution. For example, compressed sensing (CS) algorithms exploit the expected sparsity of some features of the image. In this thesis, we develop a method to exploit the sparsity in the edges of the underlying image. We design a convex optimization problem that exploits this sparsity to provide an approximation of the underlying image. Our method successfully reduces the Gibbs phenomenon with only minimal "blurring" at the discontinuities. In addition, we see a high rate of convergence in smooth regions.autWasserman, Gabriel KanterthsGelb, AnnedgcCochran, DougdgcArchibald, RickctbBarrett, The Honors CollegectbSchool of Mathematical and Statistical Sciencesenghttps://hdl.handle.net/2286/R.I.2289716 pages115093930571628716197137044gwassermIn Copyright2014-05TextSparsityMRIFourier ReconstructionCompressed Sensing