ارسل ملاحظاتك

ارسل ملاحظاتك لنا







Hop DSW: An Approximate Dynamic Space Warping Algorithm For Fast Shape Matching And Retrieval

المصدر: مجلة جامعة الملك سعود - علوم الحاسب والمعلومات
الناشر: جامعة الملك سعود
المؤلف الرئيسي: Alajlan, Naif (Author)
المجلد/العدد: مج23, ع1
محكمة: نعم
الدولة: السعودية
التاريخ الميلادي: 2011
الصفحات: 7 - 14
DOI: 10.33948/0584-023-001-002
ISSN: 1319-1578
رقم MD: 971936
نوع المحتوى: بحوث ومقالات
اللغة: الإنجليزية
قواعد المعلومات: science
مواضيع:
كلمات المؤلف المفتاحية:
Shape Matching | Shape Retrieval | Approximate Dynamic Space Warping | Dynamic Programming
رابط المحتوى:
صورة الغلاف QR قانون
حفظ في:
LEADER 02307nam a22002297a 4500
001 1714965
024 |3 10.33948/0584-023-001-002 
041 |a eng 
044 |b السعودية 
100 |9 523838  |a Alajlan, Naif  |e Author 
245 |a Hop DSW: An Approximate Dynamic Space Warping Algorithm For Fast Shape Matching And Retrieval 
260 |b جامعة الملك سعود  |c 2011 
300 |a 7 - 14 
336 |a بحوث ومقالات  |b Article 
520 |b Boundary-based shape matching has many applications in areas, such as pattern recognition and computer vision. Recently, Dynamic space warping (DSW) has emerged as a very effective tool for matching shapes. However, a central computational difficulty associated with DSW arises when a boundary’s starting point (or rotation angle) is unknown. In this paper, the HopDSW algorithm is proposed to speed up the starting point computation. Rather than performing an exhaustive search for the correct starting point as in classical approaches, the proposed algorithm operates in a coarse to-fine manner. The coarse search is global and uses a hopping step to exclude points from the search. Then, the search is refined in the neighborhood of the solution of the coarse search. A criterion that governs selecting the hopping step parameter is given, which reduces the number of starting point computations by an order. For shape representation, triangle area signature (TAS) is computed from triangles formed by the boundary points. Experimental results on the MPEG-7 CE-1 database of 1400 shapes show that the proposed algorithm returns the solution of the exhaustive search with a high degree of accuracy and a considerable reduction in the number of computations. 
653 |a علوم الحاسوب  |a الخوارزميات  |a البرمجة الديناميكية 
692 |b Shape Matching  |b Shape Retrieval  |b Approximate Dynamic Space Warping  |b Dynamic Programming 
773 |c 002  |e Journal of King Saud University (Computer and Information Sciences)  |f Maǧalaẗ ǧamʼaẗ al-malīk Saud : ùlm al-ḥasib wa al-maʼlumat  |l 001  |m مج23, ع1  |o 0584  |s مجلة جامعة الملك سعود - علوم الحاسب والمعلومات  |v 023  |x 1319-1578 
856 |u 0584-023-001-002.pdf 
930 |d y  |p y 
995 |a science 
999 |c 971936  |d 971936 

عناصر مشابهة