• opencv::轮廓周围绘制矩形框和圆形框


    基于RDP算法实现,目的是减少多边形轮廓点数
    approxPolyDP(InputArray  curve, OutputArray approxCurve,  double  epsilon,  bool  closed)
    cv::boundingRect(InputArray points)//得到轮廓周围最小矩形左上交点坐标和右下角点坐标,绘制一个矩形
    cv::minAreaRect(InputArray  points)//得到一个旋转的矩形,返回旋转矩形
    cv::minEnclosingCircle(
        InputArray points,     //得到最小区域圆形
        Point2f& center,     // 圆心位置
        float& radius        // 圆的半径
    )
    cv::fitEllipse(InputArray  points)//得到最小椭圆
    步骤
        首先将图像变为二值图像
        发现轮廓,找到图像轮廓
        通过相关API在轮廓点上找到最小包含矩形和圆,旋转矩形与椭圆。
        绘制它们。
    Mat src, gray_src, drawImg;
    int threshold_v = 170;
    int threshold_max = 255;
    RNG rng(12345);
    void Contours_Callback(int, void*);
    int main(int argc, char** argv) {
        src = imread(STRPAHT2);
        if (!src.data) {
            printf("could not load image...
    ");
            return -1;
        }
        cvtColor(src, gray_src, CV_BGR2GRAY);
        blur(gray_src, gray_src, Size(3, 3), Point(-1, -1));
    
        imshow("source_win", src);
    
        createTrackbar("Threshold Value:", "output_win", &threshold_v, threshold_max, Contours_Callback);
        Contours_Callback(0, 0);
    
        waitKey(0);
        return 0;
    }
    
    void Contours_Callback(int, void*) {
        Mat binary_output;
        vector<vector<Point>> contours;
        vector<Vec4i> hierachy;
        threshold(gray_src, binary_output, threshold_v, threshold_max, THRESH_BINARY);
        //imshow("binary image", binary_output);
        findContours(binary_output, contours, hierachy, RETR_TREE, CHAIN_APPROX_SIMPLE, Point(-1, -1));
    
        vector<vector<Point>> contours_ploy(contours.size());
        vector<Rect> ploy_rects(contours.size());
        vector<Point2f> ccs(contours.size());
        vector<float> radius(contours.size());
    
        vector<RotatedRect> minRects(contours.size());
        vector<RotatedRect> myellipse(contours.size());
    
        for (size_t i = 0; i < contours.size(); i++) {
            //轮廓周围绘制矩形 
            approxPolyDP(Mat(contours[i]), contours_ploy[i], 3, true);
    
            //得到轮廓周围最小矩形左上交点坐标和右下角点坐标,绘制一个矩形
            ploy_rects[i] = boundingRect(contours_ploy[i]);
    
            //得到一个旋转的矩形,返回旋转矩形
            minEnclosingCircle(contours_ploy[i], ccs[i], radius[i]);
            if (contours_ploy[i].size() > 5) {
                myellipse[i] = fitEllipse(contours_ploy[i]);
                minRects[i] = minAreaRect(contours_ploy[i]);
            }
        }
        
        // draw it
        drawImg = Mat::zeros(src.size(), src.type());
        Point2f pts[4];
        for (size_t t = 0; t < contours.size(); t++) {
            Scalar color = Scalar(rng.uniform(0, 255), rng.uniform(0, 255), rng.uniform(0, 255));
    
            //矩形
            //rectangle(drawImg, ploy_rects[t], color, 2, 8);
            ////circle(drawImg, ccs[t], radius[t], color, 2, 8);
    
            if (contours_ploy[t].size() > 5) {
                ellipse(drawImg, myellipse[t], color, 1, 8);
                minRects[t].points(pts);
                for (int r = 0; r < 4; r++) {
                    line(drawImg, pts[r], pts[(r + 1) % 4], color, 1, 8);
                }
            }
        }
    
        imshow("output_win", drawImg);
        return;
    }
  • 相关阅读:
    实体类字段格式校验
    .Net Core之自定义中间件
    创建型之【单例模式】
    Linux下安装Apollo (Quick Start)
    Linux下安装MySQL你又踩过多少坑【宇宙最全教程】
    C#之Expression表达式目录树
    创建型之【建造者模式】
    [LeetCode] 1675. Minimize Deviation in Array
    [LeetCode] 1996. The Number of Weak Characters in the Game
    [LeetCode] 1523. Count Odd Numbers in an Interval Range
  • 原文地址:https://www.cnblogs.com/osbreak/p/11498282.html
Copyright © 2020-2023  润新知