A Parallel Algorithm for the Counting of Ellipses Present in Conglomerates Using GPU
المؤلفون المشاركون
Trejo-Sánchez, Joel Antonio
Yam-Uicab, Reyes
López-Martínez, José
Llanes-Castro, Erika
Narvaez-Díaz, Lizzie
المصدر
Mathematical Problems in Engineering
العدد
المجلد 2018، العدد 2018 (31 ديسمبر/كانون الأول 2018)، ص ص. 1-17، 17ص.
الناشر
Hindawi Publishing Corporation
تاريخ النشر
2018-04-18
دولة النشر
مصر
عدد الصفحات
17
التخصصات الرئيسية
الملخص EN
Detecting and counting elliptical objects are an interesting problem in digital image processing.
There are real-world applications of this problem in various disciplines.
Solving this problem is harder when there is occlusion among the elliptical objects, since in general these objects are considered as part of the bigger object (conglomerate).
The solution to this problem focusses on the detection and segmentation of the precise number of occluded elliptical objects, while omitting all noninteresting objects.
There are a variety of computational approximations that focus on this problem; however, such approximations are not accurate when there is occlusion.
This paper presents an algorithm designed to solve this problem, specifically, to detect, segment, and count elliptical objects of a specific size when these are in occlusion with other objects within the conglomerate.
Our algorithm deals with a time-consuming combinatorial process.
To optimize the execution time of our algorithm, we implemented a parallel GPU version with CUDA-C, which experimentally improved the detection of occluded objects, as well as lowering processing times compared to the sequential version of the method.
Comparative test results with another method featured in literature showed improved detection of objects in occlusion when using the proposed parallel method.
نمط استشهاد جمعية علماء النفس الأمريكية (APA)
Yam-Uicab, Reyes& López-Martínez, José& Llanes-Castro, Erika& Narvaez-Díaz, Lizzie& Trejo-Sánchez, Joel Antonio. 2018. A Parallel Algorithm for the Counting of Ellipses Present in Conglomerates Using GPU. Mathematical Problems in Engineering،Vol. 2018, no. 2018, pp.1-17.
https://search.emarefa.net/detail/BIM-1208037
نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)
Yam-Uicab, Reyes…[et al.]. A Parallel Algorithm for the Counting of Ellipses Present in Conglomerates Using GPU. Mathematical Problems in Engineering No. 2018 (2018), pp.1-17.
https://search.emarefa.net/detail/BIM-1208037
نمط استشهاد الجمعية الطبية الأمريكية (AMA)
Yam-Uicab, Reyes& López-Martínez, José& Llanes-Castro, Erika& Narvaez-Díaz, Lizzie& Trejo-Sánchez, Joel Antonio. A Parallel Algorithm for the Counting of Ellipses Present in Conglomerates Using GPU. Mathematical Problems in Engineering. 2018. Vol. 2018, no. 2018, pp.1-17.
https://search.emarefa.net/detail/BIM-1208037
نوع البيانات
مقالات
لغة النص
الإنجليزية
الملاحظات
Includes bibliographical references
رقم السجل
BIM-1208037
قاعدة معامل التأثير والاستشهادات المرجعية العربي "ارسيف Arcif"
أضخم قاعدة بيانات عربية للاستشهادات المرجعية للمجلات العلمية المحكمة الصادرة في العالم العربي
تقوم هذه الخدمة بالتحقق من التشابه أو الانتحال في الأبحاث والمقالات العلمية والأطروحات الجامعية والكتب والأبحاث باللغة العربية، وتحديد درجة التشابه أو أصالة الأعمال البحثية وحماية ملكيتها الفكرية. تعرف اكثر