Skip to content
GitLab
Menu
Projects
Groups
Snippets
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Menu
Open sidebar
gaoqiong
MIGraphX
Commits
d6a2cfb5
Commit
d6a2cfb5
authored
Jun 22, 2022
by
charlie
Browse files
Formatting
parent
41663f68
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
4 additions
and
7 deletions
+4
-7
src/include/migraphx/op/nonmaxsuppression.hpp
src/include/migraphx/op/nonmaxsuppression.hpp
+4
-7
No files found.
src/include/migraphx/op/nonmaxsuppression.hpp
View file @
d6a2cfb5
...
@@ -129,11 +129,8 @@ struct nonmaxsuppression
...
@@ -129,11 +129,8 @@ struct nonmaxsuppression
// filter boxes below score_threshold
// filter boxes below score_threshold
template
<
class
T
>
template
<
class
T
>
std
::
priority_queue
<
std
::
pair
<
float
,
int64_t
>>
filter_boxes_by_score
(
T
scores
,
std
::
priority_queue
<
std
::
pair
<
float
,
int64_t
>>
filter_boxes_by_score
(
std
::
size_t
score_offset_ind
,
T
scores
,
std
::
size_t
score_offset_ind
,
std
::
size_t
num_boxes
,
float
score_threshold
)
const
std
::
size_t
num_boxes
,
float
score_threshold
)
const
{
{
std
::
priority_queue
<
std
::
pair
<
float
,
int64_t
>>
boxes_heap
;
std
::
priority_queue
<
std
::
pair
<
float
,
int64_t
>>
boxes_heap
;
auto
insert_to_boxes_heap
=
auto
insert_to_boxes_heap
=
...
@@ -185,8 +182,8 @@ struct nonmaxsuppression
...
@@ -185,8 +182,8 @@ struct nonmaxsuppression
(
batch_idx
*
num_classes
+
class_idx
)
*
num_boxes
;
(
batch_idx
*
num_classes
+
class_idx
)
*
num_boxes
;
// index to first value of this batch
// index to first value of this batch
std
::
size_t
batch_boxes_ind
=
batch_idx
*
num_boxes
*
4
;
std
::
size_t
batch_boxes_ind
=
batch_idx
*
num_boxes
*
4
;
auto
boxes_heap
=
filter_boxes_by_score
(
auto
boxes_heap
=
scores
,
score_offset_ind
,
num_boxes
,
score_threshold
);
filter_boxes_by_score
(
scores
,
score_offset_ind
,
num_boxes
,
score_threshold
);
selected_boxes_inside_class
.
clear
();
selected_boxes_inside_class
.
clear
();
// Get the next box with top score, filter by iou_threshold
// Get the next box with top score, filter by iou_threshold
while
(
!
boxes_heap
.
empty
()
&&
while
(
!
boxes_heap
.
empty
()
&&
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment