A Parallel Algorithm for the Counting of Ellipses Present in Conglomerates Using GPU
Joint Authors
Trejo-Sánchez, Joel Antonio
Yam-Uicab, Reyes
López-Martínez, José
Llanes-Castro, Erika
Narvaez-Díaz, Lizzie
Source
Mathematical Problems in Engineering
Issue
Vol. 2018, Issue 2018 (31 Dec. 2018), pp.1-17, 17 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2018-04-18
Country of Publication
Egypt
No. of Pages
17
Main Subjects
Abstract 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.
American Psychological Association (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
Modern Language Association (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
American Medical Association (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
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1208037