《图像处理实例》 之 疏密程度统计

 

---

 

疏密程度统计

以下的改进是http://www.imagepy.org/的作者原创，我只是对其理解之后改进和说明，欢迎大家使用这个小软件！

如有朋友需要源工程，请在评论处留邮箱！

 

---

 

说明：

　　　此方法是大佬给别的公司做的一个项目，本博文只对其进行方法说明！

目标：

　　　假设给定一个标准，圆与圆之间的密度为Value，当大于这个密度的时候就是不符合要求！

方法：

　　　　1.填充每个圆形目标

　　　　2.背景和前景做变换(把圆作为背景)

　　　　3.对前景进行距离变换

　　　　4.求局部最大值

　　　　5.结合最大值位置和距离图对图像进行评估

 

运行步骤：

 

下面的红色圆代表物体之间的间隙，同时也代表疏密程度值！

 核心程序：

//---fill black value
int FillBlock(Mat src, Mat &mask, Point center)
{
    uchar back = src.at<uchar>(center.y, center.x);
    vector<Point> fill_point;
    int count = 0, count_mount = 1;
    fill_point.push_back(center);
    while (count < count_mount)
    {
        vector<uchar*> img;
        vector<uchar*> msk;
        for (int i = -1; i < 2; i++)
        {
            img.push_back(src.ptr<uchar>(fill_point[count].y + i));
            msk.push_back(mask.ptr<uchar>(fill_point[count].y + i));
        }
        for (size_t i = 0; i < 3; i++)
        {
            for (int j = -1; j < 2; j++)
            {
                if (img[i][fill_point[count].x + j] == back && !(j == 0 && i == 1) && msk[i][fill_point[count].x + j] == 255)
                {
                    fill_point.push_back(Point(fill_point[count].x + j, fill_point[count].y + i - 1));
                    msk[i][fill_point[count].x + j] = 1;
                }
            }
        }
        msk[1][fill_point[count].x] = 1;
        count_mount = fill_point.size() - 1;
        fill_point.erase(fill_point.begin());
    }
    return 0;
}
//---cal mask
//---@_src        
//---@mask        
void MaskImage(InputArray _src, Mat &mask)
{
    Mat src = _src.getMat(),mask_tmp = Mat::zeros(src.size(), CV_8UC1);
    mask_tmp.setTo(255);
    Mat rows = Mat::zeros(Size(src.cols, 1), CV_8UC1), cols = Mat::zeros(Size(1, src.rows), CV_8UC1);
    Mat src_rows_beg = mask_tmp.row(0);
    Mat src_rows_end = mask_tmp.row(src.rows - 1);
    Mat src_cols_beg = mask_tmp.col(0);
    Mat src_cols_end = mask_tmp.col(src.cols - 1);
    rows.copyTo(src_rows_beg); rows.copyTo(src_rows_end);
    cols.copyTo(src_cols_beg); cols.copyTo(src_cols_end);
    for (size_t i = 1; i < src.rows-1; i++)
    {
        uchar *img0 = src.ptr<uchar>(i - 1);
        uchar *img  = src.ptr<uchar>(i);
        uchar *img1 = src.ptr<uchar>(i + 1);
        uchar *msk  = mask_tmp.ptr<uchar>(i);    
        for (size_t j = 1; j < src.cols-1; j++)
        {
            bool flag = false;
            //msk[j] = img[j] == 0 ? 0 : msk[j];
            if (msk[j] != 255) continue;
            flag = (img[j] < img[j - 1] || img[j] < img[j + 1]
                || img[j] < img0[j] || img[j] < img0[j - 1]
                || img[j] < img0[j + 1] || img[j] < img1[j]
                || img[j] < img1[j - 1] || img[j] < img1[j + 1])
                ? true : false;
            int tmp = flag == true ? FillBlock(src, mask_tmp, Point(j, i)) : 0;
        }
    }
    mask = mask_tmp.clone();
}
//---filter parts max value
//---@
//---@
//---@gap        
//---@radius    

vector<Point> Find_Max(InputArray _src, Mat&mask,int gap,int radius)
{
    Mat src = _src.getMat();
    
    typedef struct MyStruct
    {
        Point position;
        float data;
    }MyStruct;

    MaskImage(src, mask);
    vector<MyStruct> max_point;
    for (size_t i = 0; i < src.rows; i++)
    {
        uchar *img = src.ptr<uchar>(i);
        uchar *msk = mask.ptr<uchar>(i);
        for (size_t j = 0; j < src.cols; j++)
        {
            if (msk[j] != 255) continue;
            MyStruct my_struct;
            my_struct.data = img[j];
            my_struct.position = Point(j, i);
            max_point.push_back(my_struct);
        }
    }
    for (size_t i = 0; i < max_point.size(); i++)
    {
        for (size_t j = i; j < max_point.size(); j++)
        {
            MyStruct temp;
            if (max_point[i].data <= max_point[j].data)
            {
                if (max_point[j].data == 0) continue;
                temp = max_point[j];
                max_point[j] = max_point[i];
                max_point[i] = temp;
            }
        }
    }
    //---find max
    for (size_t k = 0; k < max_point.size(); k++)//---
    {
        uchar back = src.at<uchar>(max_point[k].position.y, max_point[k].position.x);
        vector<Point> fill_point;
        int count = 0, count_mount = 1;
        fill_point.push_back(max_point[k].position);
        
        while (count < count_mount &&  max_point[k].data != 1)
        {
            vector<uchar*> img;
            vector<uchar*> msk;
            for (int i = -1; i < 2; i++)
            {
                img.push_back(src.ptr<uchar>(fill_point[count].y + i));
                msk.push_back(mask.ptr<uchar>(fill_point[count].y + i));
            }
            for (int i = 0; i < 3; i++)
            {
                for (int j = -1; j < 2; j++)
                {
                    //---
                    uchar x = pow((max_point[k].position.x - fill_point[count].x + j), 2); //(max_point[k].position.x - img[i][fill_point[count].x + j])*(max_point[k].position.x - img[i][fill_point[count].x + j]);
                    uchar y = pow((max_point[k].position.y - (fill_point[count].y + i - 1)) , 2); // (max_point[k].position.y - img[i][fill_point[count].y + j])*(max_point[k].position.y - img[i][fill_point[count].x + j]);
                    uchar distance = sqrt(x + y);
                    if (img[i][fill_point[count].x + j] <= img[1][fill_point[count].x] - gap 
                        || msk[i][fill_point[count].x + j] == 3
                        || msk[i][fill_point[count].x + j] == 0
                        || (j == 0 && i == 1)
                        || distance >= radius) continue;
                    if (img[i][fill_point[count].x + j] == 2) max_point[k].data = 1;
                    msk[i][fill_point[count].x + j] = 3;
                    fill_point.push_back(Point(fill_point[count].x + j, fill_point[count].y + i - 1));
                    count_mount++;
                }
            }
            count++;
        }    
        if (max_point[k].data == 1)
        {
            for (size_t i = 0; i < fill_point.size(); i++)
            {
                mask.at<uchar>(fill_point[i]) = 1;
            }
        }
        else
        {
            for (size_t i = 0; i < fill_point.size(); i++)
            {
                mask.at<uchar>(fill_point[i]) = 2;
            }
            max_point[k].data = 255;
            mask.at<uchar>(max_point[k].position) = 255;
        }
    }
}