IDEAS home Printed from https://ideas.repec.org/a/eee/stapro/v80y2010i11-12p922-925.html
   My bibliography  Save this article

On asymptotic convergence of the block-iterative Fisher scoring algorithm

Author

Listed:
  • Hudson, Malcolm
  • Ma, Jun

Abstract

This short paper studies convergence properties, particularly asymptotic convergence, of the block-iterative Fisher scoring (BFS) algorithms recently proposed by Ma and Hudson (2008). While applicable in other inverse problem domains (e.g. astronomy, geophysics, signal processing or remote sensing), this class of algorithms was designed for tomographic image reconstruction from projections in medicine. A BFS algorithm is used to reconstruct the patient's internal structural or functional activity from collected projection data. We briefly introduce the BFS algorithm and a general convergence result provided in Ma and Hudson (2008). This result is used to prove the asymptotic convergence of two specific BFS algorithms under new conditions.

Suggested Citation

  • Hudson, Malcolm & Ma, Jun, 2010. "On asymptotic convergence of the block-iterative Fisher scoring algorithm," Statistics & Probability Letters, Elsevier, vol. 80(11-12), pages 922-925, June.
    • Handle: RePEc:eee:stapro:v:80:y:2010:i:11-12:p:922-925
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0167-7152(10)00041-6
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:stapro:v:80:y:2010:i:11-12:p:922-925. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/622892/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.