Cart (Loading....) | Create Account
Close category search window

Sparse object reconstruction from a limited number of projections using the linear programming

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 ; Univ. of Tsukuba, Japan ; Kudo, H. ; Jicun Hu ; Johnson, R.

This paper proposes a simple 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 the nonlinear programming to construct a row-action type iterative algorithm to find a solution, we also prove that the algorithm converges for any initial image. We show that this method works well in the 3D blood-vessel reconstruction and its computation time is shorter compared to our previous method.

Published in:

Nuclear Science Symposium Conference Record, 2002 IEEE  (Volume:2 )

Date of Conference:

10-16 Nov. 2002

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.