Tearsback's picture
download
raw
7.44 kB
#include "ai_model.h"
#if defined(OD_MODEL)
extern u32 object_num;
extern ObjectResult objects[];
extern ObjectResult results[];
#if defined(yolofastestv2)
void handle_preds(float *preds,float conf_thr)
{
u32 i,j,stage,pos_x,pos_y;
object_num=0;
for(i=0;i<OUT_HEIGHT;i++)
{
if(i<(INPUT_WIDTH*INPUT_HEIGHT)/(16*16))
{
pos_x=i%(INPUT_WIDTH/16);
pos_y=i/(INPUT_WIDTH/16);
stage=0;
}
else
{
pos_x=(i-(INPUT_WIDTH*INPUT_HEIGHT)/(16*16))%(INPUT_WIDTH/32);
pos_y=(i-(INPUT_WIDTH*INPUT_HEIGHT)/(16*16))/(INPUT_WIDTH/32);
stage=1;
}
u32 cls_index=15;
#if OUT_CHANNEL>16
float cls=0;
for(j=15;j<OUT_CHANNEL;j++)
{
if(*(preds+OUT_CHANNEL*i+j)>cls)
{
cls=*(preds+OUT_CHANNEL*i+j);
cls_index=j;
}
}
#else
float cls=1;
#endif
cls_index-=15;
for(j=0;j<3;j++)
{
float *reg=preds+OUT_CHANNEL*i+j*4;
float obj=*(preds+OUT_CHANNEL*i+12+j);
if(obj*cls>conf_thr)
{
*(reg)=(*(reg)*2-0.5f+pos_x)*(stage+1)*16;
*(reg+1)=(*(reg+1)*2-0.5f+pos_y)*(stage+1)*16;
*(reg+2)=((*(reg+2)*2)*(*(reg+2)*2))*anchors[stage*6+j*2];
*(reg+3)=((*(reg+3)*2)*(*(reg+3)*2))*anchors[stage*6+j*2+1];
objects[object_num].confi=obj*cls;
objects[object_num].bbox.x_min=*(reg)-*(reg+2)/2;
objects[object_num].bbox.y_min=*(reg+1)-*(reg+3)/2;
objects[object_num].bbox.x_max=*(reg)+*(reg+2)/2;
objects[object_num].bbox.y_max=*(reg+1)+*(reg+3)/2;
objects[object_num].cls_index=cls_index;
objects[object_num].name=activities[cls_index];
object_num++;
}
}
}
}
#elif defined(yolov10)
void handle_preds(float *preds,float conf_thr)
{
u32 i,j,k;
object_num=0;
for(i=0;i<OUT_HEIGHT;i++)
{
float conf=preds[i*OUT_CHANNEL];
float xyxy[4];
float offset=0;
#if defined(USE_TAA)
offset=0.5;
#endif
#if REG_MAX > 1
for(j=0;j<4;j++)
{
xyxy[j]=0;
for(k=0;k<REG_MAX;k++)
{
xyxy[j]+=k*preds[i*OUT_CHANNEL+j*REG_MAX+k+1];
}
}
xyxy[0]=(i%(INPUT_WIDTH/16)+offset-xyxy[0]*REG_SCALE)*16;
xyxy[1]=(i/(INPUT_HEIGHT/16)+offset-xyxy[1]*REG_SCALE)*16;
xyxy[2]=(i%(INPUT_WIDTH/16)+offset+xyxy[2]*REG_SCALE)*16;
xyxy[3]=(i/(INPUT_HEIGHT/16)+offset+xyxy[3]*REG_SCALE)*16;
#else
xyxy[0]=(i%(INPUT_WIDTH/16)+offset+preds[i*OUT_CHANNEL+1])*16;
xyxy[1]=(i/(INPUT_HEIGHT/16)+offset+preds[i*OUT_CHANNEL+2])*16;
xyxy[2]=preds[i*OUT_CHANNEL+3]*INPUT_WIDTH;
xyxy[3]=preds[i*OUT_CHANNEL+4]*INPUT_HEIGHT;
xyxy[0]-=xyxy[2]/2;
xyxy[1]-=xyxy[3]/2;
xyxy[2]+=xyxy[0];
xyxy[3]+=xyxy[1];
#endif
u32 cls_index=0;
float cls=0;
#if defined(USE_TAA)
for(j=1+REG_MAX*4;j<OUT_CHANNEL;j++)
{
if(preds[i*OUT_CHANNEL+j]>cls)
{
cls=preds[i*OUT_CHANNEL+j];
cls_index=j;
}
}
cls_index-=(1+REG_MAX*4);
conf=cls;
#else
#if OUT_CHANNEL>2+REG_MAX*4
for(j=1+REG_MAX*4;j<OUT_CHANNEL;j++)
{
if(preds[i*OUT_CHANNEL+j]>cls)
{
cls=preds[i*OUT_CHANNEL+j];
cls_index=j;
}
}
cls_index-=(1+REG_MAX*4);
conf*=cls;
#endif
#endif
if(conf>conf_thr)
{
objects[object_num].bbox.x_min=xyxy[0];
objects[object_num].bbox.y_min=xyxy[1];
objects[object_num].bbox.x_max=xyxy[2];
objects[object_num].bbox.y_max=xyxy[3];
objects[object_num].confi=conf;
objects[object_num].cls_index=cls_index;
objects[object_num].name=activities[cls_index];
object_num++;
}
}
}
#else
#error "The expected model name is undefined"
#endif
int compare(const ObjectResult *a, const ObjectResult *b)
{
return a->confi < b->confi ? 1 : -1;
}
float iou(ObjectResult a, ObjectResult b)
{
float x1 = a.bbox.x_min > b.bbox.x_min ? a.bbox.x_min : b.bbox.x_min; // std::max
float y1 = a.bbox.y_min > b.bbox.y_min ? a.bbox.y_min : b.bbox.y_min; // std::max
float x2 = a.bbox.x_max > b.bbox.x_max ? b.bbox.x_max : a.bbox.x_max; // std::min
float y2 = a.bbox.y_max > b.bbox.y_max ? b.bbox.y_max : a.bbox.y_max; // std::min
if (x2 <= x1 || y2 <= y1) return 0;
float a_width = a.bbox.x_max - a.bbox.x_min;
float a_height = a.bbox.y_max - a.bbox.y_min;
float b_width = b.bbox.x_max - b.bbox.x_min;
float b_heihgt = b.bbox.y_max - b.bbox.y_min;
float inter_area = (x2 - x1) * (y2 - y1);
float outer_area = ((a_width * a_height) + b_width * b_heihgt - inter_area);
if(outer_area==0)
{
return 0;
}
float iou = inter_area / outer_area;
return iou;
}
void nms(ObjectResult object[], ObjectResult result[], u32* total, float nmsThreshold)
{
qsort(object, *total, sizeof(ObjectResult), compare);
for (uint16_t i = 0; i < *total; ++i)
{
uint16_t index = 1;
result[i] = object[i];
for (uint16_t j = i + 1; j < *total; ++j)
{
if (iou(result[i], object[j]) < nmsThreshold)
{
object[index] = object[j];
index += 1;
}
}
*total = index;
if (index == 1)
{
*total = i + 1;
}
}
}
#endif

Xet Storage Details

Size:
7.44 kB
·
Xet hash:
40818e9ab69c6caa940b312cbfa4748074226b0bcbd8f0b336cdde599b9613ed

Xet efficiently stores files, intelligently splitting them into unique chunks and accelerating uploads and downloads. More info.