Analysis of the use of unmatched backward operators in iterative image reconstruction with application to three-dimensional optoacoustic tomography

Yang Lou, Seonyeong Park, Fatima Anis, Richarc Su, Alexander Oraevesky, Mark Anastasio

Research output: Contribution to journalArticle

Abstract

Due to their ability to model complicated imaging physics, to compensate for imperfect data acquisition systems, and to exploit prior information regarding the to-be-imaged object, iterative image reconstruction algorithms can often produce higher quality images than analytical reconstruction methods. However, for three-dimensional (3D) imaging tasks with large fields-of-view, iterative reconstruction methods can be computationally burdensome. A common cause for this is the need to repeatedly evaluate the forward operator and its adjoint. From the algorithmic perspective, one way to accelerate iterative algorithms is to substitute the adjoint operator with an unmatched approximation of it that can be computed more efficiently. Previous works have investigated some of the impacts of employing unmatched backward operators in iterative algorithms. The current study builds extends the theoretical analysis of unmatched backward operators to a more general penalized least squares framework that allows for complex eigenvalues and regularization. Additionally, a convergence condition for a Landweber-type algorithm employing an unmatched backward operator is presented and numerically corroborated. An unmatched backward operator is introduced to accelerate iterative image reconstruction in 3D optoacoustic tomography (OAT) and it is investigated by use of experimental data.
Original languageEnglish (US)
Pages (from-to)1-1
JournalIEEE Transactions on Computational Imaging
DOIs
StatePublished - Jan 1 2019
Externally publishedYes

Fingerprint

Photoacoustic effect
Image Reconstruction
Tomography
Image reconstruction
Mathematical operators
Three-dimensional
Operator
Iterative Algorithm
Accelerate
Imaging techniques
Three-dimensional Imaging
Penalized Least Squares
Adjoint Operator
3D Imaging
Convergence Condition
Image quality
Reconstruction Algorithm
Prior Information
Data acquisition
Substitute

Cite this

Analysis of the use of unmatched backward operators in iterative image reconstruction with application to three-dimensional optoacoustic tomography. / Lou, Yang; Park, Seonyeong; Anis, Fatima; Su, Richarc; Oraevesky, Alexander; Anastasio, Mark.

In: IEEE Transactions on Computational Imaging, 01.01.2019, p. 1-1.

Research output: Contribution to journalArticle

@article{f12f95dd8eba4769b3280e375449cdc3,
title = "Analysis of the use of unmatched backward operators in iterative image reconstruction with application to three-dimensional optoacoustic tomography",
abstract = "Due to their ability to model complicated imaging physics, to compensate for imperfect data acquisition systems, and to exploit prior information regarding the to-be-imaged object, iterative image reconstruction algorithms can often produce higher quality images than analytical reconstruction methods. However, for three-dimensional (3D) imaging tasks with large fields-of-view, iterative reconstruction methods can be computationally burdensome. A common cause for this is the need to repeatedly evaluate the forward operator and its adjoint. From the algorithmic perspective, one way to accelerate iterative algorithms is to substitute the adjoint operator with an unmatched approximation of it that can be computed more efficiently. Previous works have investigated some of the impacts of employing unmatched backward operators in iterative algorithms. The current study builds extends the theoretical analysis of unmatched backward operators to a more general penalized least squares framework that allows for complex eigenvalues and regularization. Additionally, a convergence condition for a Landweber-type algorithm employing an unmatched backward operator is presented and numerically corroborated. An unmatched backward operator is introduced to accelerate iterative image reconstruction in 3D optoacoustic tomography (OAT) and it is investigated by use of experimental data.",
author = "Yang Lou and Seonyeong Park and Fatima Anis and Richarc Su and Alexander Oraevesky and Mark Anastasio",
year = "2019",
month = "1",
day = "1",
doi = "10.1109/TCI.2019.2895217",
language = "English (US)",
pages = "1--1",
journal = "IEEE Transactions on Computational Imaging",
issn = "2573-0436",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Analysis of the use of unmatched backward operators in iterative image reconstruction with application to three-dimensional optoacoustic tomography

AU - Lou, Yang

AU - Park, Seonyeong

AU - Anis, Fatima

AU - Su, Richarc

AU - Oraevesky, Alexander

AU - Anastasio, Mark

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Due to their ability to model complicated imaging physics, to compensate for imperfect data acquisition systems, and to exploit prior information regarding the to-be-imaged object, iterative image reconstruction algorithms can often produce higher quality images than analytical reconstruction methods. However, for three-dimensional (3D) imaging tasks with large fields-of-view, iterative reconstruction methods can be computationally burdensome. A common cause for this is the need to repeatedly evaluate the forward operator and its adjoint. From the algorithmic perspective, one way to accelerate iterative algorithms is to substitute the adjoint operator with an unmatched approximation of it that can be computed more efficiently. Previous works have investigated some of the impacts of employing unmatched backward operators in iterative algorithms. The current study builds extends the theoretical analysis of unmatched backward operators to a more general penalized least squares framework that allows for complex eigenvalues and regularization. Additionally, a convergence condition for a Landweber-type algorithm employing an unmatched backward operator is presented and numerically corroborated. An unmatched backward operator is introduced to accelerate iterative image reconstruction in 3D optoacoustic tomography (OAT) and it is investigated by use of experimental data.

AB - Due to their ability to model complicated imaging physics, to compensate for imperfect data acquisition systems, and to exploit prior information regarding the to-be-imaged object, iterative image reconstruction algorithms can often produce higher quality images than analytical reconstruction methods. However, for three-dimensional (3D) imaging tasks with large fields-of-view, iterative reconstruction methods can be computationally burdensome. A common cause for this is the need to repeatedly evaluate the forward operator and its adjoint. From the algorithmic perspective, one way to accelerate iterative algorithms is to substitute the adjoint operator with an unmatched approximation of it that can be computed more efficiently. Previous works have investigated some of the impacts of employing unmatched backward operators in iterative algorithms. The current study builds extends the theoretical analysis of unmatched backward operators to a more general penalized least squares framework that allows for complex eigenvalues and regularization. Additionally, a convergence condition for a Landweber-type algorithm employing an unmatched backward operator is presented and numerically corroborated. An unmatched backward operator is introduced to accelerate iterative image reconstruction in 3D optoacoustic tomography (OAT) and it is investigated by use of experimental data.

U2 - 10.1109/TCI.2019.2895217

DO - 10.1109/TCI.2019.2895217

M3 - Article

SP - 1

EP - 1

JO - IEEE Transactions on Computational Imaging

JF - IEEE Transactions on Computational Imaging

SN - 2573-0436

ER -