کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
412545 | 679652 | 2012 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Fully affine invariant SURF for image matching
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Fully affine invariant SURF for image matching Fully affine invariant SURF for image matching](/preview/png/412545.png)
چکیده انگلیسی
Fast and robust feature extraction is crucial for many computer vision applications such as image matching. The representative and the state-of-the-art image features include Scale Invariant Feature Transform (SIFT), Speeded Up Robust Features (SURF), and Affine SIFT (ASIFT). However, neither of them is fully affine invariant and computation efficient at the same time. To overcome this problem, we propose in this paper a fully affine invariant SURF algorithm. The proposed algorithm makes full use of the affine invariant advantage of ASIFT and the efficient merit of SURF while avoids their drawbacks. Experimental results on applications of image matching demonstrate the robustness and efficiency of the proposed algorithm.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Neurocomputing - Volume 85, 15 May 2012, Pages 6–10
Journal: Neurocomputing - Volume 85, 15 May 2012, Pages 6–10
نویسندگان
Yanwei Pang, Wei Li, Yuan Yuan, Jing Pan,