IOU计算，邻接矩阵法

最新推荐文章于 2024-03-03 19:58:02 发布

jzdl

最新推荐文章于 2024-03-03 19:58:02 发布

阅读量313

点赞数

分类专栏： python 文章标签： python numpy 开发语言

本文链接：https://blog.csdn.net/zhuhuigege/article/details/127508137

版权

python 同时被 2 个专栏收录

8 篇文章 0 订阅

订阅专栏

深度学习

7 篇文章 0 订阅

订阅专栏

import numpy as np

box1 = np.array([[10, 10, 50, 50],
                [70, 70, 120, 120]])
box2 = np.array([[10, 10, 50, 50],
                [100, 100, 150, 150],
                [80, 80, 160, 160],
                [130, 130, 200, 200],
                [130, 130, 200, 200]])

def iou_match_grid(box1, box2):
    #（n,4）+(m,4)=(n,m),（2,4）+(4,4)=(2,4)
    print(box1.shape)
    print(box2.shape)
    x11, y11, x12, y12 = np.split(box1, 4, axis=1)
    x21, y21, x22, y22 = np.split(box2, 4, axis=1)
    xa = np.maximum(x11, np.transpose(x21))
    xb = np.minimum(x12, np.transpose(x22))
    ya = np.maximum(y11, np.transpose(y21))
    yb = np.minimum(y12, np.transpose(y22))

    area_inter = np.maximum(0, (xb - xa + 1)) * np.maximum(0, (yb - ya + 1))

    area_1 = (x12 - x11 + 1) * (y12 - y11 + 1)
    area_2 = (x22 - x21 + 1) * (y22 - y21 + 1)
    area_union = area_1 + np.transpose(area_2) - area_inter
    iou = area_inter / area_union
    return iou

print(iou_match_grid(box1, box2))
print(iou_match_grid(box1, box2).shape)