Harris 角点检测

#include "opencv2/highgui/highgui.hpp"
#include "opencv2/imgproc/imgproc.hpp"
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
using namespace cv;
using namespace std;
void CornerHarris(const Mat& srcImage, Mat& result, 
				  int blockSize, int kSize, double k)
{
	Mat src;
	srcImage.copyTo(src);
	result.create(src.size(), CV_32F);
	int depth = src.depth();
	// 检测掩膜尺寸
	double scale = (double)(1 << ((kSize > 0 ?
kSize : 3) - 1)) * blockSize;
	if (depth == CV_8U)
		scale *= 255.;
	scale = 1. / scale;
	// sobel滤波
	Mat dx, dy;
	Sobel(src, dx, CV_32F, 1, 0, kSize, scale, 0);
	Sobel(src, dy, CV_32F, 0, 1, kSize, scale, 0);
	Size size = src.size();
	cv::Mat cov(size, CV_32FC3);
	int i, j;
	// 求解水平与竖直梯度
	for (i = 0; i < size.height; i++){
		float *covData = (float*)(cov.data + i*cov.step);
		const float *dxData = (const float*)(dx.data + i*dx.step);
		const float *dyData = (const float*)(dy.data + i*dy.step);
		for (j = 0; j < size.width; j++)
		{
			float dx_ = dxData[j];
			float dy_ = dyData[j];
			covData[3 * j] = dx_*dx_;
			covData[3 * j + 1] = dx_*dy_;
			covData[3 * j + 2] = dy_*dy_;
		}
	}
	// 计算窗口内求和
	boxFilter(cov, cov, cov.depth(), 
		Size(blockSize, blockSize), Point(-1, -1), false);
	// 判断图像连续性
	if (cov.isContinuous() && result.isContinuous())
	{
		size.width *= size.height;
		size.height = 1;
	}
	else
		size = result.size();
	// 计算响应函数 
	for (i = 0; i < size.height; i++)
	{
		// 获取图像矩阵指针
		float *resultData = (float*)(result.data + i*result.step);
		const float *covData = (const float*)(cov.data + i*cov.step);
		for (j = 0; j < size.width; j++)
		{
			// 焦点响应生成
			float a = covData[3 * j];
			float b = covData[3 * j + 1];
			float c = covData[3 * j + 2];
			resultData[j] = a*c - b*b - k*(a + c)*(a + c);
		}
	}
}
int main()
{
	cv::Mat srcImage = cv::imread("..\\images\\sea.jpg");
	if (!srcImage.data)
		return -1;
	cv::imshow("srcImage", srcImage);
	cv::Mat srcGray, result;
	cvtColor(srcImage, srcGray, CV_BGR2GRAY);
	result = Mat::zeros(srcImage.size(), CV_32FC1);
	// 角点检测参数
	int blockSize = 2;
	int apertureSize = 3;
	double k = 0.04;
	// 角点检测
	// cornerHarris( srcGray, result, blockSize, apertureSize, k, BORDER_DEFAULT );
	CornerHarris(srcGray, result, blockSize, apertureSize, k);
	// 矩阵归一化
	normalize(result, result, 0, 255, NORM_MINMAX, CV_32FC1, Mat());
	convertScaleAbs(result, result);
	// 绘图角点检测结果
	for (int j = 0; j < result.rows; j++)
	{
		for (int i = 0; i < result.cols; i++)
		{
			if ((int)(result.at<uchar>(j, i)) > 150)
			{
				circle(srcImage, Point(i, j), 5, Scalar(0), 2, 8, 0);
			}
		}
	}
	cv::imshow("result", srcImage);
	cv::waitKey(0);
	return 0;
}



转载:http://blog.youkuaiyun.com/zhuwei1988

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值