图像闭运算

最新推荐文章于 2024-03-14 17:54:43 发布

Shey_Chen

最新推荐文章于 2024-03-14 17:54:43 发布

阅读量1.2k

点赞数

分类专栏：形态学操作文章标签：闭运算-膨胀-腐蚀

本文链接：https://blog.csdn.net/a361251388leaning/article/details/50357863

版权

形态学操作专栏收录该内容

3 篇文章 0 订阅

订阅专栏

闭运算是先膨胀后腐蚀，它能填充细小空洞，连接邻近物体、平滑边界，同时不明显改变其面积。
闭运算的数学表达式是
这里写图片描述


#include"cv.h"
#include "highgui.h"


void erode(CvMat *src, CvMat *dst);
void dilate(CvMat *src, CvMat *dst);
void close(CvMat *src, CvMat *dst);

int main()
{
    IplImage *src = cvLoadImage("linzhilin.jpg",1);

    const int width = src->width;
    const int height = src->height;

    CvMat* gray = cvCreateMat(height, width, CV_8UC1);
    CvMat* closeImg = cvCreateMat(height, width, CV_8UC1);


    cvCvtColor(src, gray, CV_BGR2GRAY);
    cvThreshold(gray, gray, 1, 255, CV_THRESH_OTSU);
    close(gray, closeImg);


    cvShowImage("SRC", src);
    cvShowImage("BINARY IMAGE", gray);
    cvShowImage("CLOSE", closeImg);

    cvWaitKey(0);

    cvSaveImage("binImg.bmp", gray);
    cvSaveImage("close.bmp", closeImg);

    cvReleaseMat(&gray);
    cvReleaseMat(&closeImg);

    return 0;
}

void erode(CvMat *src, CvMat *dst)
{
    const int WIDTH = src->width;
    const int HEIGHT = src->height;

    memcpy(dst->data.ptr, src->data.ptr, WIDTH*HEIGHT);
    uchar* srcData = (uchar*)(src->data.ptr);

    for(int j = 0;  j < HEIGHT - 1;  j ++)
    {
        uchar* dstData = (uchar*)(dst->data.ptr + j * dst->step);
        for(int i = 0; i < WIDTH - 1; i ++)
        {
            bool found = false;
            dstData[i] = 255;
            for(int m = 0; m < 3; m ++)
            {
                if(found)
                    break;
                for(int n = 0; n < 3; n ++)
                {
                    if((srcData + (j + m - 1) * src->step)[i + n - 1] == 0)
                    {
                        dstData[i] = 0;
                        found = true;
                        break;
                    }
                }
            }
        }
    }
}

void dilate(CvMat *src, CvMat *dst)
{
    const int WIDTH = src->width;
    const int HEIGHT = src->height;

    memcpy(dst->data.ptr, src->data.ptr, WIDTH*HEIGHT);
    uchar* srcData = (uchar*)(src->data.ptr);

    for(int j = 0;  j < HEIGHT - 1;  j ++)
    {
        uchar* dstData = (uchar*)(dst->data.ptr + j * dst->step);
        for(int i = 0; i < WIDTH - 1; i ++)
        {
            bool found = false;
            dstData[i] = 0;
            for(int m = 0; m < 3; m ++)
            {
                if(found)
                    break;
                for(int n = 0; n < 3; n ++)
                {
                    if((srcData + (j + m - 1) * src->step)[i + n - 1] == 255)
                    {
                        dstData[i] = 255;
                        found = true;
                        break;
                    }
                }
            }
        }
    }
}
void close(CvMat *src, CvMat *dst)
{
    CvMat *closeImg = cvCloneMat(src);
    dilate(src, dst);
    erode(dst, closeImg);
    cvCopy(closeImg, dst);
    cvReleaseMat(&closeImg);
}