Algorithm 1. Identifying the bounding boxes of each skeleton. |
1. Input:
n: number of skeletons
m: number of bounding boxes
|
2. Output:
k: number of persons |
3. for in : |
4. = min
|
5. = min
|
6. = max
|
7. = max
|
8. .append
|
9.
|
10. = [True for (i, ) in enumerate()] |
11. for (, ) in enumerate(): |
12: = -1 |
13. = 0 |
14. for (, ) in enumerate(): |
15. if not(status_skeletons[]): |
16. continue |
17. if < count_points(, ): |
18. = count_points(, ) |
19.
|
20. if == -1: |
21. .append() |
22. else: |
23. = False |
24.
|
25.
|
26. return
|