| Paper: | MP-L3.4 |
| Session: | Interpolation and Superresolution I |
| Time: | Monday, September 17, 15:30 - 15:50 |
| Presentation: |
Lecture
|
| Title: |
SPARSE GRADIENT IMAGE RECONSTRUCTION DONE FASTER |
| Authors: |
Ray Maleh; University of Michigan | | |
| | Anna Gilbert; University of Michigan | | |
| | Martin Strauss; University of Michigan | | |
| Abstract: |
In a wide variety of imaging applications (especially medical imaging), we obtain a partial set or subset of the Fourier transform of an image. From these Fourier measurements, we want to reconstruct the entire original image. Convex optimization is a powerful, recent solution to this problem. Unfortunately, convex optimization in its myriad of implementations is computationally expensive and may be impractical for large images or for multiple images. Furthermore, some of these techniques assume that the image has a sparse gradient (i.e., that the gradient of the image consists of a few nonzero pixel values) or that the gradient is highly compressible. In this paper, we demonstrate that we can recover such images with GRADIENTOMP, an efficient algorithm based upon Orthogonal Matching Pursuit (OMP), more effectively than with convex optimization. We compare both the qualitative and quantitative performance of this algorithm to the optimization techniques. |
