کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1153229 | 1489902 | 2010 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On asymptotic convergence of the block-iterative Fisher scoring algorithm
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
آمار و احتمال
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On asymptotic convergence of the block-iterative Fisher scoring algorithm On asymptotic convergence of the block-iterative Fisher scoring algorithm](/preview/png/1153229.png)
چکیده انگلیسی
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.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Statistics & Probability Letters - Volume 80, Issues 11–12, 1–15 June 2010, Pages 922–925
Journal: Statistics & Probability Letters - Volume 80, Issues 11–12, 1–15 June 2010, Pages 922–925
نویسندگان
Malcolm Hudson, Jun Ma,