OpenCV编程->双目匹配计算棋盘格角点计算及两轴位移计算

//两幅图像的棋盘格角点检测
	cv::Mat image_gray=img11;
	std::vector<cv::Point2f> cornersL, cornersR;

	bool retL = cv::findChessboardCorners(image_gray,
		cv::Size(11, 8),
		cornersL,
		cv::CALIB_CB_ADAPTIVE_THRESH |
		cv::CALIB_CB_NORMALIZE_IMAGE);

	cv::Mat image_gray1 = img21;
	bool retR = cv::findChessboardCorners(image_gray1,
		cv::Size(11, 8),
		cornersR,
		cv::CALIB_CB_ADAPTIVE_THRESH |
		cv::CALIB_CB_NORMALIZE_IMAGE);



vector<uchar> m;
	vector<float> vx;
	vector<float> vy;
	float vxa=0, vya=0;
	for (int i = 0; i < cornersL.size(); i++)
	{
		vx.push_back(cornersL[i].x - cornersR[i].x);
		vy.push_back(cornersL[i].y - cornersR[i].y);

		vxa = vxa + cornersL[i].x - cornersR[i].x;
		vya = vya + cornersL[i].y - cornersR[i].y;
		cout << "x is "<<cornersL[i].x - cornersR[i].x << "  ";
		cout << "y is "<<cornersL[i].y - cornersR[i].y << endl;
	}
	//输出棋盘格角点X轴、Y轴平均位移
	vxa = vxa / cornersL.size();
	vya = vya / cornersL.size();


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值