کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9655195 | 684007 | 2005 | 20 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Reconstruction of 8-connected but not 4-connected hv-convex discrete sets
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Reconstruction of 8-connected but not 4-connected hv-convex discrete sets Reconstruction of 8-connected but not 4-connected hv-convex discrete sets](/preview/png/9655195.png)
چکیده انگلیسی
The reconstruction of 8-connected but not 4-connected hv-convex discrete sets from few projections is considered. An algorithm is given with worst case complexity of O(mnmin{m,n}) to reconstruct all sets with given horizontal and vertical projections. Experimental results are also presented. It is shown, that using also the diagonal projections the algorithm can be speeded up having complexity of O(mn) and in this case the solution is uniquely determined. Finally, we consider the possible generalizations of our results to solve the problem in more general classes.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 147, Issues 2â3, 15 April 2005, Pages 149-168
Journal: Discrete Applied Mathematics - Volume 147, Issues 2â3, 15 April 2005, Pages 149-168
نویسندگان
Péter Balázs, Emese Balogh, Attila Kuba,