mirror of
https://github.com/PaddlePaddle/FastDeploy.git
synced 2025-10-05 16:48:03 +08:00
c7dc7d5eee
* 更正代码格式 * 更正代码格式 * 修复语法错误 * fix rk error * update * update * update * update * update * update * update Co-authored-by: Jason <jiangjiajun@baidu.com>
93 lines
3.0 KiB
C++
93 lines
3.0 KiB
C++
// Copyright (c) 2022 PaddlePaddle Authors. All Rights Reserved. //NOLINT
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
#include "fastdeploy/vision/detection/contrib/rknpu2/utils.h"
|
|
float clamp(float val, int min, int max) {
|
|
return val > min ? (val < max ? val : max) : min;
|
|
}
|
|
|
|
float Sigmoid(float x) { return 1.0 / (1.0 + expf(-x)); }
|
|
|
|
float UnSigmoid(float y) { return -1.0 * logf((1.0 / y) - 1.0); }
|
|
|
|
inline int32_t __clip(float val, float min, float max) {
|
|
float f = val <= min ? min : (val >= max ? max : val);
|
|
return f;
|
|
}
|
|
|
|
int8_t QntF32ToAffine(float f32, int32_t zp, float scale) {
|
|
float dst_val = (f32 / scale) + zp;
|
|
int8_t res = (int8_t)__clip(dst_val, -128, 127);
|
|
return res;
|
|
}
|
|
|
|
float DeqntAffineToF32(int8_t qnt, int32_t zp, float scale) {
|
|
return ((float)qnt - (float)zp) * scale;
|
|
}
|
|
|
|
static float CalculateOverlap(float xmin0, float ymin0, float xmax0, float ymax0, float xmin1, float ymin1, float xmax1, float ymax1)
|
|
{
|
|
float w = fmax(0.f, fmin(xmax0, xmax1) - fmax(xmin0, xmin1) + 1.0);
|
|
float h = fmax(0.f, fmin(ymax0, ymax1) - fmax(ymin0, ymin1) + 1.0);
|
|
float i = w * h;
|
|
float u = (xmax0 - xmin0 + 1.0) * (ymax0 - ymin0 + 1.0) + (xmax1 - xmin1 + 1.0) * (ymax1 - ymin1 + 1.0) - i;
|
|
return u <= 0.f ? 0.f : (i / u);
|
|
}
|
|
|
|
int NMS(int validCount,
|
|
std::vector<float> &outputLocations,
|
|
std::vector<int> &class_id,
|
|
std::vector<int> &order,
|
|
float threshold,
|
|
bool class_agnostic)
|
|
{
|
|
// printf("class_agnostic: %d\n", class_agnostic);
|
|
for (int i = 0; i < validCount; ++i)
|
|
{
|
|
if (order[i] == -1)
|
|
{
|
|
continue;
|
|
}
|
|
int n = order[i];
|
|
for (int j = i + 1; j < validCount; ++j)
|
|
{
|
|
int m = order[j];
|
|
if (m == -1)
|
|
{
|
|
continue;
|
|
}
|
|
|
|
if (!class_agnostic && class_id[n] != class_id[m]){
|
|
continue;
|
|
}
|
|
|
|
float xmin0 = outputLocations[n * 4 + 0];
|
|
float ymin0 = outputLocations[n * 4 + 1];
|
|
float xmax0 = outputLocations[n * 4 + 0] + outputLocations[n * 4 + 2];
|
|
float ymax0 = outputLocations[n * 4 + 1] + outputLocations[n * 4 + 3];
|
|
|
|
float xmin1 = outputLocations[m * 4 + 0];
|
|
float ymin1 = outputLocations[m * 4 + 1];
|
|
float xmax1 = outputLocations[m * 4 + 0] + outputLocations[m * 4 + 2];
|
|
float ymax1 = outputLocations[m * 4 + 1] + outputLocations[m * 4 + 3];
|
|
|
|
float iou = CalculateOverlap(xmin0, ymin0, xmax0, ymax0, xmin1, ymin1, xmax1, ymax1);
|
|
|
|
if (iou > threshold)
|
|
{
|
|
order[j] = -1;
|
|
}
|
|
}
|
|
}
|
|
return 0;
|
|
} |