《图像处理实例》 之 二值图像分割

---

二值图像分割

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

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

---

原理：给定最大值处的种子点，然后进行涨水，各个种子点进行碰撞

void Binary_Division(InputArray& _src, Mat& mask, vector<Point> Edge_Point)
{
    Mat src = _src.getMat();// , mask = _mask.getMat();
                
    mask = src.clone();
    distanceTransform(src, src, DIST_L2, DIST_MASK_3, 5);
    normalize(src, src, 0, 255, NORM_MINMAX);
    src.convertTo(src, CV_8UC1);
    
    vector<vector<Point>> Edge_Data;
    for (size_t i = 0; i < Edge_Point.size(); i++)
    {
        vector<Point> temp;
        temp.push_back(Edge_Point[i]);
        Edge_Data.push_back(temp);
        mask.at<uchar>(Edge_Point[i]) = i + 1;
    }
    
    const int histSize = 255;
    float range[] = { 0, 255 };
    const float* histRange = { range };
    Mat hist;
    calcHist(&src, 1, 0, Mat(), hist, 1, &histSize, &histRange, true, false);

    
    hist = hist.reshape(1, 1);
    normalize(hist, hist, 0, 1000, NORM_MINMAX);
    hist.convertTo(hist, CV_32FC1);
    for (size_t level = 255; level > 0; level--)
    {
        if (!hist.at<float>(0, level)) continue;
        FindRidge(src, mask, Edge_Data, level);
    }
}

void FindRidge(InputArray& _src, Mat& mask, vector<vector<Point>>& Edge_Point,int level)
{
    Mat src = _src.getMat();
    for (size_t i = 0; i < Edge_Point.size(); i++)
    {
        uchar pre_mark = i + 1;
        for (int j = 0; j < Edge_Point[i].size(); j++)
        {
            vector<Point> temp_vector;
            temp_vector.push_back(Point(Edge_Point[i][j].x, Edge_Point[i][j].y - 1));
            temp_vector.push_back(Point(Edge_Point[i][j].x, Edge_Point[i][j].y + 1));
            temp_vector.push_back(Point(Edge_Point[i][j].x - 1, Edge_Point[i][j].y));
            temp_vector.push_back(Point(Edge_Point[i][j].x + 1, Edge_Point[i][j].y));
            uchar* msk = mask.ptr(Edge_Point[i][j].y);
            uchar* img = src.ptr(Edge_Point[i][j].y);
            if (img[Edge_Point[i][j].x] < level)    continue;
            if (msk[j] == 254)
            {
                Edge_Point[i].erase(Edge_Point[i].begin() + j);
                j--;
                continue;
            }
            bool Flag = true;
            for (size_t j = 0; j < temp_vector.size(); j++)
            {
                uchar* pre_data = mask.ptr(temp_vector[j].y);
                if (pre_data[temp_vector[j].x] != pre_mark && pre_data[temp_vector[j].x] != 0 
                    && pre_data[temp_vector[j].x] != 255 && pre_data[temp_vector[j].x] != (150+i+1)
                    && pre_data[temp_vector[j].x] != 254)
                {
                    pre_data[temp_vector[j].x] = 254;
                    continue;
                }
                else if (pre_data[temp_vector[j].x] == 0 || pre_data[temp_vector[j].x] == pre_mark || pre_data[temp_vector[j].x] == 254) continue;            
                else if (pre_data[temp_vector[j].x] == 255)
                {
                    if (src.at<uchar>(temp_vector[j]) <= level)
                    {
                        pre_data[temp_vector[j].x] = pre_mark;
                        Edge_Point[i].push_back(temp_vector[j]);
                        //Edge_Point[i].insert(Edge_Point[i].begin() + j + 1, temp_vector[j]);
                    }
                    else
                    {
                        FillBlock(src, Edge_Point[i], mask, level, Edge_Point[i][j], i);
                        Flag = false;
                    }
                }
            }
            if (Flag)
            {
                mask.at<uchar>(Edge_Point[i][j]) = 150 + i + 1;
                Edge_Point[i].erase(Edge_Point[i].begin() + j);
                j--;
            }
            else
            {
                mask.at<uchar>(Edge_Point[i][j]) = i + 1;
            }
        }
    }
}

void FillBlock(InputArray& _src, vector<Point>& Edge_Point, Mat& mask, int level, Point center,int seed_num)
{
    Mat src = _src.getMat();
    mask.at<uchar>(center) = seed_num + 151;
    vector<Point> fill_point;
    int count = 0, count_mount = 1;//count；
    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] > level && !(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] = seed_num + 151;
                }
                else if (img[i][fill_point[count].x + j] <= level && msk[i][fill_point[count].x + j] == 255)
                {
                    Edge_Point.push_back(Point(fill_point[count].x + j, fill_point[count].y + i - 1));
                    msk[i][fill_point[count].x + j] = seed_num + 1;
                }
            }
        }
        //msk[1][fill_point[count].x] = 2;
        count_mount = fill_point.size() - 1;
        fill_point.erase(fill_point.begin());
    }
}