Image Reconstruction from Undersampled Fourier Data Using the Polynomial Annihilation Transform

Rick Archibald, Anne Gelb, Rodrigo Platte

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

Fourier samples are collected in a variety of applications including magnetic resonance imaging and synthetic aperture radar. The data are typically under-sampled and noisy. In recent years, (Formula presented.) regularization has received considerable attention in designing image reconstruction algorithms from under-sampled and noisy Fourier data. The underlying image is assumed to have some sparsity features, that is, some measurable features of the image have sparse representation. The reconstruction algorithm is typically designed to solve a convex optimization problem, which consists of a fidelity term penalized by one or more (Formula presented.) regularization terms. The Split Bregman Algorithm provides a fast explicit solution for the case when TV is used for the (Formula presented.) regularization terms. Due to its numerical efficiency, it has been widely adopted for a variety of applications. A well known drawback in using TV as an (Formula presented.) regularization term is that the reconstructed image will tend to default to a piecewise constant image. This issue has been addressed in several ways. Recently, the polynomial annihilation edge detection method was used to generate a higher order sparsifying transform, and was coined the “polynomial annihilation (PA) transform.” This paper adapts the Split Bregman Algorithm for the case when the PA transform is used as the (Formula presented.) regularization term. In so doing, we achieve a more accurate image reconstruction method from under-sampled and noisy Fourier data. Our new method compares favorably to the TV Split Bregman Algorithm, as well as to the popular TGV combined with shearlet approach.

Original languageEnglish (US)
JournalJournal of Scientific Computing
DOIs
StateAccepted/In press - Sep 5 2015

Fingerprint

Image Reconstruction
Image reconstruction
Annihilation
Regularization
Polynomials
Mathematical transformations
Transform
Polynomial
Term
Reconstruction Algorithm
Sparse Representation
Convex optimization
Magnetic Resonance Imaging
Synthetic Aperture
Edge Detection
Edge detection
Magnetic resonance
Synthetic aperture radar
Explicit Solution
Convex Optimization

Keywords

  • $$l^1$$l1regularization
  • Edge Detection
  • Fourier Data
  • Polynomial Annihilation
  • Split Bregman

ASJC Scopus subject areas

  • Software
  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Engineering(all)

Cite this

Image Reconstruction from Undersampled Fourier Data Using the Polynomial Annihilation Transform. / Archibald, Rick; Gelb, Anne; Platte, Rodrigo.

In: Journal of Scientific Computing, 05.09.2015.

Research output: Contribution to journalArticle

@article{c758044f622b4ca0afcb548cc4e76d98,
title = "Image Reconstruction from Undersampled Fourier Data Using the Polynomial Annihilation Transform",
abstract = "Fourier samples are collected in a variety of applications including magnetic resonance imaging and synthetic aperture radar. The data are typically under-sampled and noisy. In recent years, (Formula presented.) regularization has received considerable attention in designing image reconstruction algorithms from under-sampled and noisy Fourier data. The underlying image is assumed to have some sparsity features, that is, some measurable features of the image have sparse representation. The reconstruction algorithm is typically designed to solve a convex optimization problem, which consists of a fidelity term penalized by one or more (Formula presented.) regularization terms. The Split Bregman Algorithm provides a fast explicit solution for the case when TV is used for the (Formula presented.) regularization terms. Due to its numerical efficiency, it has been widely adopted for a variety of applications. A well known drawback in using TV as an (Formula presented.) regularization term is that the reconstructed image will tend to default to a piecewise constant image. This issue has been addressed in several ways. Recently, the polynomial annihilation edge detection method was used to generate a higher order sparsifying transform, and was coined the “polynomial annihilation (PA) transform.” This paper adapts the Split Bregman Algorithm for the case when the PA transform is used as the (Formula presented.) regularization term. In so doing, we achieve a more accurate image reconstruction method from under-sampled and noisy Fourier data. Our new method compares favorably to the TV Split Bregman Algorithm, as well as to the popular TGV combined with shearlet approach.",
keywords = "$$l^1$$l1regularization, Edge Detection, Fourier Data, Polynomial Annihilation, Split Bregman",
author = "Rick Archibald and Anne Gelb and Rodrigo Platte",
year = "2015",
month = "9",
day = "5",
doi = "10.1007/s10915-015-0088-2",
language = "English (US)",
journal = "Journal of Scientific Computing",
issn = "0885-7474",
publisher = "Springer New York",

}

TY - JOUR

T1 - Image Reconstruction from Undersampled Fourier Data Using the Polynomial Annihilation Transform

AU - Archibald, Rick

AU - Gelb, Anne

AU - Platte, Rodrigo

PY - 2015/9/5

Y1 - 2015/9/5

N2 - Fourier samples are collected in a variety of applications including magnetic resonance imaging and synthetic aperture radar. The data are typically under-sampled and noisy. In recent years, (Formula presented.) regularization has received considerable attention in designing image reconstruction algorithms from under-sampled and noisy Fourier data. The underlying image is assumed to have some sparsity features, that is, some measurable features of the image have sparse representation. The reconstruction algorithm is typically designed to solve a convex optimization problem, which consists of a fidelity term penalized by one or more (Formula presented.) regularization terms. The Split Bregman Algorithm provides a fast explicit solution for the case when TV is used for the (Formula presented.) regularization terms. Due to its numerical efficiency, it has been widely adopted for a variety of applications. A well known drawback in using TV as an (Formula presented.) regularization term is that the reconstructed image will tend to default to a piecewise constant image. This issue has been addressed in several ways. Recently, the polynomial annihilation edge detection method was used to generate a higher order sparsifying transform, and was coined the “polynomial annihilation (PA) transform.” This paper adapts the Split Bregman Algorithm for the case when the PA transform is used as the (Formula presented.) regularization term. In so doing, we achieve a more accurate image reconstruction method from under-sampled and noisy Fourier data. Our new method compares favorably to the TV Split Bregman Algorithm, as well as to the popular TGV combined with shearlet approach.

AB - Fourier samples are collected in a variety of applications including magnetic resonance imaging and synthetic aperture radar. The data are typically under-sampled and noisy. In recent years, (Formula presented.) regularization has received considerable attention in designing image reconstruction algorithms from under-sampled and noisy Fourier data. The underlying image is assumed to have some sparsity features, that is, some measurable features of the image have sparse representation. The reconstruction algorithm is typically designed to solve a convex optimization problem, which consists of a fidelity term penalized by one or more (Formula presented.) regularization terms. The Split Bregman Algorithm provides a fast explicit solution for the case when TV is used for the (Formula presented.) regularization terms. Due to its numerical efficiency, it has been widely adopted for a variety of applications. A well known drawback in using TV as an (Formula presented.) regularization term is that the reconstructed image will tend to default to a piecewise constant image. This issue has been addressed in several ways. Recently, the polynomial annihilation edge detection method was used to generate a higher order sparsifying transform, and was coined the “polynomial annihilation (PA) transform.” This paper adapts the Split Bregman Algorithm for the case when the PA transform is used as the (Formula presented.) regularization term. In so doing, we achieve a more accurate image reconstruction method from under-sampled and noisy Fourier data. Our new method compares favorably to the TV Split Bregman Algorithm, as well as to the popular TGV combined with shearlet approach.

KW - $$l^1$$l1regularization

KW - Edge Detection

KW - Fourier Data

KW - Polynomial Annihilation

KW - Split Bregman

UR - http://www.scopus.com/inward/record.url?scp=84940876698&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940876698&partnerID=8YFLogxK

U2 - 10.1007/s10915-015-0088-2

DO - 10.1007/s10915-015-0088-2

M3 - Article

JO - Journal of Scientific Computing

JF - Journal of Scientific Computing

SN - 0885-7474

ER -