python实现iou的方法

最新推荐文章于 2024-02-22 19:13:55 发布

resut

最新推荐文章于 2024-02-22 19:13:55 发布

阅读量745

点赞数

分类专栏： python

本文链接：https://blog.csdn.net/qq_40285271/article/details/94484138

版权

python 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

 def iou(test_box,base_box):
      ret = 0 
      #若坐标为空，return 0
      if test_box == []:                                                                                            
          return ret
      if base_box == []:                                                                                            
          return ret                                                                                                
      x1 = test_box[0]                                                                                              
      y1 = test_box[1]                                                                                              
      w1 = test_box[2]
      h1 = test_box[3]
              
      x2 = base_box[0]                                                                                              
      y2 = base_box[1]
      w2 = base_box[2]
      h2 = base_box[3]
              
      x = max(x1+w1,x2+w2)                                                                                       
      min_x = min(x1,x2)
      w = w1+w2-(x-min_x)
              
      y = max(y1+h1,y2+h2)                                                                                       
      min_y = min(y1,y2)                                                                                           
      h = h1+h2-(y-min_y)
              
      if w <=0 or h <= 0:
          ret = 0 
      else:   
          #重叠面积
          Area = w*h                                                                                                
          Area1 = w1*h1
          Area2 = w2*h2
          #Area1+Area2-Area为除去重叠面积的部分
          ret = Area*1./(Area1+Area2-Area)                                                                          
      return  ret