کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
531753 | 869875 | 2007 | 19 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments Development and evaluation of fast branch-and-bound algorithm for feature matching based on line segments](/preview/png/531753.png)
چکیده انگلیسی
By extending the previously proposed geometric branch-and-bound algorithm with bounded alignment for point pattern matching, the paper presents the development and evaluation of a new and fast algorithm for image registration based on line segments. Using synthetically generated data sets with randomly distributed line segments and hard test cases with highly symmetric line patterns, as well as real remote sensing images, the developed algorithm is shown to be computationally fast, highly robust, capable of handling severely corrupted data sets with considerable line segment position errors as well as significant fragmented and spurious line segments in the images to be matched.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Pattern Recognition - Volume 40, Issue 5, May 2007, Pages 1432–1450
Journal: Pattern Recognition - Volume 40, Issue 5, May 2007, Pages 1432–1450
نویسندگان
Lik-Kwan Shark, Andrey A. Kurekin, Bogdan J. Matuszewski,