کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
527455 | 869325 | 2007 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A decomposition technique for reconstructing discrete sets from four projections
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The reconstruction of discrete sets from four projections is in general an NP-hard problem. In this paper we study the class of decomposable discrete sets and give an efficient reconstruction algorithm for this class using four projections. It is also shown that an arbitrary discrete set which is Q-convex along the horizontal and vertical directions and consists of several components is decomposable. As a consequence of decomposability we get that in a subclass of hv-convex discrete sets the reconstruction from four projections can also be solved in polynomial time. Possible extensions of our method are also discussed.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Image and Vision Computing - Volume 25, Issue 10, 1 October 2007, Pages 1609–1619
Journal: Image and Vision Computing - Volume 25, Issue 10, 1 October 2007, Pages 1609–1619
نویسندگان
Péter Balázs,