Opencv學習筆記(二十三) 改進邊緣檢測算子-----Marr-Hildresh

Marr-Hildresh邊緣檢測算子,用於解決邊緣檢測的核心問題---定位精度和抑制噪聲。Marr-Hildreth算子以高斯函數爲平滑算子,結合拉普拉斯算子提取二階導數的零交叉理論進行邊緣檢測。邊緣檢測中灰度變化與圖像尺寸無關,檢測算子可爲不同尺度,灰度變化梯度在一階導數的極值點(波峯或波谷),或在二階導數爲零的交叉點。

由於噪聲點對邊緣檢測有一定的影響,所以效果更好的邊緣檢測器是LoG算子。它把高斯平滑濾波器和拉普拉斯銳化濾波器結合起來,先平滑掉噪聲,再進行邊緣檢測,所以效果會更好。

Marr-Hildreth邊緣檢測代碼:

#include <opencv2/core/core.hpp>
#include <opencv2/highgui/highgui.hpp>
#include <opencv2/imgproc/imgproc.hpp>
#include <iostream>
using namespace cv;
using namespace std;
void marrEdge(const Mat src, Mat& result, int kerValue, double delta)
{
	//計算LoG算子
	Mat kernel;
	//半徑
	int kerLen = kerValue / 2;
	kernel = Mat_<double>(kerValue, kerValue);
	//滑窗
	for (int i = -kerLen; i <= kerLen; i++)
	{
		for (int j = -kerLen; j <= kerLen; j++)
		{
			//生成核因子
			kernel.at<double>(i + kerLen, j + kerLen) = exp(-((pow(j, 2) + pow(i, 2)) / (pow(delta, 2) * 2)))
				*((pow(j, 2) + pow(i, 2) - 2 * pow(delta, 2)) / (2 * pow(delta, 4)));
		}
	}
	//設置輸入參數
	int kerOffset = kerValue / 2;
	Mat laplacian = (Mat_<double>(src.rows - kerOffset * 2, src.cols - kerOffset * 2));
	result = Mat::zeros(src.rows - kerOffset * 2, src.cols - kerOffset * 2, src.type());
	double sumLaplacian;
	//遍歷計算卷積圖像的拉普拉斯算子
	for (int i = kerOffset; i < src.rows - kerOffset; ++i)
	{
		for (int j = kerOffset; j < src.cols - kerOffset; ++j)
		{
			sumLaplacian = 0;
			for (int k = -kerOffset; k <= kerOffset; ++k)
			{
				for (int m = -kerOffset; m <= kerOffset; ++m)
				{
					//計算圖像卷積
					sumLaplacian += src.at<uchar>(i + k, j + m)*kernel.at<double>(kerOffset + k, kerOffset + m);
				}
			}
			//生成拉普拉斯結果
			laplacian.at<double>(i - kerOffset, j - kerOffset) = sumLaplacian;
		}
	}
	for (int y = 1; y < result.rows - 1; ++y)
	{
		for (int x = 1; x < result.cols-1; ++x)
		{
			result.at<uchar>(y, x) = 0;
			//領域判定
			if (laplacian.at<double>(y - 1, x)*laplacian.at<double>(y + 1, x) < 0)
			{
				result.at<uchar>(y, x) = 255;
			}
			if (laplacian.at<double>(y, x - 1)*laplacian.at<double>(y, x + 1) < 0)
			{
				result.at<uchar>(y, x) = 255;
			}
			if (laplacian.at<double>(y + 1, x - 1)*laplacian.at<double>(y - 1, x + 1) < 0)
			{
				result.at<uchar>(y, x) = 255;
			}
			if (laplacian.at<double>(y - 1, x - 1)*laplacian.at<double>(y + 1, x + 1) < 0)
			{
				result.at<uchar>(y, x) = 255;
			}
		}
	}
}
int main()
{
	Mat srcImage = imread("C:/Users/si/Desktop/2.png");
	if (!srcImage.data)
		return -1;
	Mat edge,srcGray;
	cvtColor(srcImage, srcGray, CV_RGB2GRAY);
	marrEdge(srcGray, edge, 9, 1.6);
	imshow("srcImage", srcImage);
	imshow("edge", edge);
	waitKey(0);
	return 0;

}

程序運行效果圖:


發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.
相關文章