Mathematical Sciences: Faculty Presentations (1991-2022)

A Generalized l₁ Greedy Algorithm for Image Reconstruction in Computed Tomography

Document Type

Presentation

Presentation Date

1-9-2013

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.

Abstract or Description

The sparse vector solutions for an underdetermined system of linear equations Ax = b have many applications in signal recovery and image reconstruction in tomography. Under certain conditions, the sparsest solution can be found by solving a constrained l₁ minimization problem: min ||x||₁ subject to Ax = b. Recently, the reweighted l₁ minimization and l₁ greedy algorithm have been introduced to improve the convergence of the l₁ minimization problem. As an extension, a generalized l₁ greedy algorithm for computerized tomography (CT) is proposed in this paper. It is implemented as a generalized total variation minimization for images with sparse gradients in CT. A numerical experiment is also given to illustrate the advantage of the new algorithm.

Sponsorship/Conference/Institution

Joint Mathematics Meetings (JMM)

Location

San Diego, CA

Link to Full Text

Share

COinS