C++ OPENCV 获得两矩形的交集矩形

本文介绍了一种计算两个矩形交集的算法实现,通过判断矩形中心的距离和尺寸来确定交集是否存在,并给出了具体的代码实现。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

获得两个矩形的交集,该交集类型也是矩形

在这里插入图片描述
这种情况就范围交集的矩形,蓝色部分;

在这里插入图片描述
这种情况返回 cv::Rect(cv::Point(0,0),cv::Point(0,0) );

欢迎测试,提BUG;


/** @brief 获得两个矩形的交集
@param rect1; rect2 is lds range.
@output cv::Rect 交集
 */
cv::Rect get_IOU(cv::Rect rect1, cv::Rect rect2){


    // 横向和纵向距离
    cout <<"input " << rect1 << rect2 << endl;
    cv::Point center_rect1 = (rect1.tl()+rect1.br()) * 0.5;
    cv::Point center_rect2 = (rect2.tl()+rect2.br()) * 0.5;
    cout <<"input center" << rect1 << rect2 << endl;
    auto verti_dis = abs(center_rect1.x - center_rect2.x);
    auto horiz_dis = abs(center_rect1.y - center_rect2.y);
    // 高度和宽度之和的一半
    auto half_w = (rect1.width + rect2.width) / 2;
    auto half_y = (rect1.height + rect2.height) / 2;
    cout << verti_dis << " " << half_y << " " << verti_dis << " " << half_w << endl;

    if ( horiz_dis < half_y && verti_dis < half_w) {
        int x_tl , x_br, y_tl, y_br;

        if(rect1.tl().x > rect2.tl().x){
            if(rect1.br().x > rect2.br().x){
                x_tl = rect1.tl().x;
                x_br = rect2.br().x;
            } else{
                x_tl = rect1.tl().x;
                x_br = rect1.br().x;
            }
        } else{
            if(rect1.br().x > rect2.br().x){
                x_tl = rect2.tl().x;
                x_br = rect2.br().x;
            } else{
                x_tl = rect2.tl().x;
                x_br = rect1.br().x;
            }
        }


        if(rect1.tl().y > rect2.tl().y){
            if(rect1.br().y > rect2.br().y){
                y_tl = rect1.tl().y;
                y_br = rect2.br().y;
            } else{
                y_tl = rect1.tl().y;
                y_br = rect1.br().y;
            }
        } else{
            if(rect1.br().x > rect2.br().y){
                y_tl = rect2.tl().y;
                y_br = rect2.br().y;
            } else{
                y_tl = rect2.tl().y;
                y_br = rect1.br().y;
            }
        }

        cv::Point tl(x_tl, y_tl);
        cv::Point br(x_br, y_br);
        return cv::Rect(tl, br);

    }
    return cv::Rect(cv::Point(0,0),cv::Point(0,0) );


}

版本2

/** @brief 获得两个矩形的交集
@param rect1;rect2 is lds range.
@output cv::Rect 交集
 */
cv::Rect get_IOU(cv::Rect rect1, cv::Rect rect2){
    // 横向和纵向距离
    std::cout <<"input " << rect1 << " " << rect2 << std::endl;
    cv::Point center_rect1 = (rect1.tl() + rect1.br()) * 0.5;
    cv::Point center_rect2 = (rect2.tl() + rect2.br()) * 0.5;
    std::cout <<"input center" << center_rect1 << " " << center_rect2 << std::endl;
    auto verti_dis = std::abs(center_rect1.x - center_rect2.x);
    auto horiz_dis = std::abs(center_rect1.y - center_rect2.y);
    // 高度和宽度之和的一半
    auto half_w = (rect1.width + rect2.width) / 2;
    auto half_h = (rect1.height + rect2.height) / 2;
    std::cout << verti_dis << " " << half_h << " " << horiz_dis << " " << half_w << std::endl;

    if (horiz_dis < half_w && verti_dis < half_h) {
        int x_tl = std::max(rect1.tl().x, rect2.tl().x);
        int y_tl = std::max(rect1.tl().y, rect2.tl().y);
        int x_br = std::min(rect1.br().x, rect2.br().x);
        int y_br = std::min(rect1.br().y, rect2.br().y);

        if (x_tl < x_br && y_tl < y_br) {
            return cv::Rect(cv::Point(x_tl, y_tl), cv::Point(x_br, y_br));
        }
    }
    return cv::Rect(cv::Point(0, 0), cv::Point(0, 0));
}
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值