By Topic

Improved iterative algorithm for sparse object reconstruction and its performance evaluation with micro-CT data

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Meihua Li ; Doctoral Program in Eng., Univ. of Tsukuba, Japan ; Kudo, H. ; Jicun Hu ; Johnson, R.H.

This paper proposes a new row-action type iterative algorithm which is appropriate to reconstruct sparse objects from a limited number of projections. The main idea is to use the L1 norm to pick up a sparse solution from a set of feasible solutions to the measurement equation. By perturbing the linear program to a quadratic program, we use the duality of nonlinear programming to construct a row-action type iterative algorithm to find the solution. We also prove that the algorithm converges to the solution under mild assumptions. We show that this method works well in the 3-D blood-vessel reconstruction and its computation time is shorter than those of our previous method and MART method. Furthermore, we apply the method to real data measured with the Micro-CT device developed at Marquette University.

Published in:

Nuclear Science, IEEE Transactions on  (Volume:51 ,  Issue: 3 )