def calcIOU(one_x, one_y, one_w, one_h, two_x, two_y, two_w, two_h):
if((abs(one_x - two_x) < ((one_w + two_w) / 2.0)) and (abs(one_y - two_y) < ((one_h + two_h) / 2.0))):
lu_x_inter = max((one_x - (one_w / 2.0)), (two_x - (two_w / 2.0)))
lu_y_inter = min((one_y + (one_h / 2.0)), (two_y + (two_h / 2.0)))
rd_x_inter = min((one_x + (one_w / 2.0)), (two_x + (two_w / 2.0)))
rd_y_inter = max((one_y - (one_h / 2.0)), (two_y - (two_h / 2.0)))
inter_w = abs(rd_x_inter - lu_x_inter)
inter_h = abs(lu_y_inter - rd_y_inter)
inter_square = inter_w * inter_h
union_square = (one_w * one_h) + (two_w * two_h) - inter_square
calcIOU = inter_square / union_square * 1.0
else:
#print("No intersection!")
return 0
return calcIOU
计算两个矩形的交并比
最新推荐文章于 2022-10-14 20:47:43 发布