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

Iterative image reconstruction algorithms based on cross-entropy minimization

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

1 Author(s)
Byrne, C.L. ; Dept. of Math., Massachusetts Univ., Lowell, MA, USA

The related problems of minimizing the functionals F(x)=αKL(y,Px)+(1-α)KL(p ,x) and G(x)=αKL(Px,y)+(1-α)KL(x ,p), respectively, over the set of vectors x⩾0 are considered. KL(a, b) is the cross-entropy (or Kullback-Leibler) distance between two nonnegative vectors a and b. Iterative algorithms for minimizing both functionals using the method of alternating projections are derived. A simultaneous version of the multiplicative algebraic reconstruction technique (MART) algorithm, called SMART, is introduced, and its convergence is proved

Published in:

Image Processing, IEEE Transactions on  (Volume:2 ,  Issue: 1 )

Date of Publication:

Jan 1993

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.