IoU (Intersection over Union)

最新推荐文章于 2024-07-16 17:12:38 发布

bestination

最新推荐文章于 2024-07-16 17:12:38 发布

阅读量173

点赞数

分类专栏： Python 文章标签：深度学习神经网络

本文链接：https://blog.csdn.net/bestination/article/details/108608703

版权

Python 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

import unittest

def IoU(box1, box2):
    """  Interscetion over Union, box = [x1, y1, x2, y2] """
    intersection_x = min(box1[2], box2[2]) - max(box1[0], box2[0])
    intersection_y = min(box1[3], box2[3]) - max(box1[1], box2[1])
    intersection = 0 if intersection_x < 0 or intersection_y < 0 \
                     else intersection_x * intersection_y

    if intersection <= 0:
        return 0

    union = (box1[2] - box1[0]) * (box1[3] - box1[1]) + \
            (box2[2] - box2[0]) * (box2[3] - box2[1]) - intersection

    return intersection / union

class TestIoU(unittest.TestCase):

    def test_IoU_case0(self):
        self.assertEqual(IoU([0,0,2,2], [1,1,3,3]), 1/7)
        
    def test_IoU_case1(self):
        self.assertEqual(IoU([1,1,3,3], [0,0,2,2]), 1/7)

    def test_IoU_case2(self):
        self.assertEqual(IoU([1,0,3,2], [0,1,2,3]), 1/7)

    def test_IoU_case3(self):
        self.assertEqual(IoU([0,1,2,3], [1,0,3,2]), 1/7)

    def test_IoU_case4(self):
        self.assertEqual(IoU([0,0,3,3], [1,1,2,2]), 1/9)

    def test_IoU_case5(self):
        self.assertEqual(IoU([1,1,2,2], [0,0,3,3]), 1/9)

    def test_IoU_case6(self):
        self.assertEqual(IoU([0,0,1,1], [2,2,3,3]), 0)

    def test_IoU_case7(self):
        self.assertEqual(IoU([2,2,3,3], [0,0,1,1]), 0)

    def test_IoU_case8(self):
        self.assertEqual(IoU([1,0,3,2], [0,0,2,2]), 2/6)

    def test_IoU_case9(self):
        self.assertEqual(IoU([1,0,3,2], [0,0,1,1]), 0)


unittest.main()