Dr. Jang Hwan Cho Profile

Dr. Jang Hwan Cho

Image reconstruction engineer

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 3 March 2012 Paper

Accelerating ordered-subsets image reconstruction for x-ray CT using double surrogates

Jang Hwan Cho, Jeffrey Fessler

Proceedings Volume 8313, 83131X (2012) https://doi.org/10.1117/12.911531

KEYWORDS: Image restoration, Reconstruction algorithms, X-ray computed tomography, X-rays, X-ray imaging, Optimization (mathematics), Image quality, Algorithm development, Computer simulations, Tomography

Read Abstract +

Conventional ordered-subsets (OS) methods for regularized image reconstruction involve computing the gradient of the regularizer for every subset update. When dealing with large problems with many subsets, such as in 3D X-ray CT, computing the gradient for each subset update can be very computationally expensive. To mitigate this issue, some investigators use unregularized iterations followed by a denoising operation after updating all subsets.¹ Although such methods save computation, their convergence properties are uncertain, and since they may not be minimizing any particular cost function it becomes more difficult to design regularization parameters. Furthermore, it is known that inserting filtering steps into unregularized algorithms can lead to undesirable spatial resolution properties.² Our goal here is to reduce the computational cost without inducing such problems. We propose a new OS-type algorithm that is derived using optimization transfer principles. The proposed method allows the gradient of the regularizer to be updated less frequently, and thus reduces the computational expense when many subsets are used. Our derivation leads to a correction term that accounts for the fact that the regularizer gradient is updated less frequent than every sub-iteration. Simulations and a phantom experiment show that the proposed method reconstructed images with compatible image quality within reduced computation time.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years