کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4629815 | 1340586 | 2013 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A generalized l1 greedy algorithm for image reconstruction in CT
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The sparse vector solutions for an underdetermined system of linear equations Ax=b have many applications in signal recovery and image reconstruction in tomography. Under certain conditions, the sparsest solution can be found by solving a constrained l1 minimization problem: min||x||1 subject to Ax=b. Recently, the reweighted l1 minimization and l1 greedy algorithm have been introduced to improve the convergence of the l1 minimization problem. As an extension, a generalized l1 greedy algorithm for computerized tomography (CT) is proposed in this paper. It is implemented as a generalized total variation minimization for images with sparse gradients in CT. Numerical experiments are also given to illustrate the advantage of the new algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 219, Issue 10, 15 January 2013, Pages 5487-5494
Journal: Applied Mathematics and Computation - Volume 219, Issue 10, 15 January 2013, Pages 5487-5494
نویسندگان
Jiehua Zhu, Xiezhang Li,