Fast implementation for fluorescence tomography based on coordinate descent with limited measurements

Zhenwen Xue; Chenghu Qin; Ping Wu; Xin Yang; Jie Tian

doi:10.1117/12.911722

14 April 2012 Fast implementation for fluorescence tomography based on coordinate descent with limited measurements

Zhenwen Xue, Chenghu Qin, Ping Wu, Xin Yang, Jie Tian

Proceedings Volume 8317, Medical Imaging 2012: Biomedical Applications in Molecular, Structural, and Functional Imaging; 831713 (2012) https://doi.org/10.1117/12.911722
Event: SPIE Medical Imaging, 2012, San Diego, California, United States

Abstract

Fluorescence molecular tomography (FMT) can three-dimensionally resolve molecular activities in in vivo small animal through the reconstruction of the distribution of fluorescent probes. Due to large number of unknowns and limited measurements from the surfaces of small animals, the FMT problem is often ill-posed and ill-conditioned. Though various L2-norm regularizations can make the solution stable, they usually make the solution over-smoothed. During the early stages of tumor detection, fluorescent sources that indicate the distribution of tumors are usually small and sparse, which can be regarded as a type of a priori information. L1-norm regularizations have been incorporated to promote the sparsity of optical tomographic problems. In this paper, an efficient method with the L1-norm regularization based on coordinate descent is proposed to solve the FMT problem with extremely limited measurements. The proposed method minimizes the objective by solving a sequence of scalar minimization subproblems in multi-variable minimization. Each subproblem improves the estimate of the solution via minimizing along a determined coordinate with all other coordinates fixed. This algorithm first updates the coordinate that makes the energy decrease the most. Non-existence of matrix-vector multiplication in the iteration process makes the proposed algorithm time-efficient. To evaluate this method, we compare it to the iterated-shrinkage-based algorithm with L1-norm regularization in numerical experiments. The proposed algorithm is able to obtain satisfactory reconstruction results even when the measurements are very limited. Besides, the proposed algorithm is about two orders of magnitude faster than the iterated-shrinkage-based algorithm, which enables the proposed algorithm into practical applications.

Citation Download Citation

Zhenwen Xue, Chenghu Qin, Ping Wu, Xin Yang, and Jie Tian "Fast implementation for fluorescence tomography based on coordinate descent with limited measurements", Proc. SPIE 8317, Medical Imaging 2012: Biomedical Applications in Molecular, Structural, and Functional Imaging, 831713 (14 April 2012); https://doi.org/10.1117/12.911722

ACCESS THE FULL ARTICLE

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: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
6 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Reconstruction algorithms

Fluorescence tomography

Tomography

Tumors

Evolutionary algorithms

Luminescence

Compressed sensing

Show All Keywords

Keywords/Phrases

Search In:

Publication Years