A Parallel Algorithm for the Counting of Ellipses Present in Conglomerates Using GPU

Table 2

Comparison of the runtimes of the parallel algorithm with the best sequential algorithm for the counting of elliptical objects in the presence of conglomerates using images from the first group to measure the increase in performance of the parallel method.

Conglomerate	Parallel algorithm time (seconds)	Sequential algorithm time (seconds)	Ellipses detected	PSs detected
1	0.445	0.013	3	3
2	0.443	0.01	4	5
3	0.447	0.011	5	7
4	0.443	0.014	6	9
5	0.453	0.016	7	11
6	0.453	0.023	8	13
7	0.453	0.046	9	15
8	0.437	0.099	10	17
9	0.469	0.218	11	19
10	0.453	0.582	12	21
11	0.485	2.1	13	23
12	0.594	7.938	14	25
13	1.047	31.807	15	27
14	3.02	130.77	16	29
15	11.266	527.306	17	31