Opencv求兩個矩形是否相交,以及相交的比值

來源:互聯網
上載者:User

在影像處理中經常會遇到判斷兩個矩形是否相交,以及相交的比例的情況,下面是來自TLD演算法中源碼的求法:

float bbOverlap(const BoundingBox& box1,const BoundingBox& box2){  if (box1.x > box2.x+box2.width) { return 0.0; }  if (box1.y > box2.y+box2.height) { return 0.0; }  if (box1.x+box1.width < box2.x) { return 0.0; }  if (box1.y+box1.height < box2.y) { return 0.0; }  float colInt =  min(box1.x+box1.width,box2.x+box2.width) - max(box1.x, box2.x);  float rowInt =  min(box1.y+box1.height,box2.y+box2.height) - max(box1.y,box2.y);  float intersection = colInt * rowInt;  float area1 = box1.width*box1.height;  float area2 = box2.width*box2.height;  return intersection / (area1 + area2 - intersection);}

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.