三十一、点多边形测试
1、概念介绍
测试一个点是否在给定的多边形内部、边缘或者外部
2、API介绍cv::pointPolygonTest
pointPolygonTest(
InputArray contours,//输入的轮廓
Point2f pt,//测试点
bool meatureDist//是否返回距离值,如果是false,1表示在内面,0表示在边界上,-1表示在外部,如果是true返回实际距离,外部为负值,内部为正值,返回数据为double类型
)
3、步骤
- 构建一张400*400大小的图像
Mat::zeros(400, 400, CV_8UC1)
- 画上一个六边形的闭合区域
line
- 发现轮廓
findContours
- 对图像中所有像素点做点多边形测试,得到距离
pointPolygonTest
- 归一化后显示
示例代码:(生成距离图)
#include <opencv2/opencv.hpp>
#include <iostream>
#include <math.h>
using namespace cv;
using namespace std;
int main(int argc, char** argv) {
const int r = 100;
Mat src = Mat::zeros(r * 4, r * 4, CV_8UC1);//创建一张400*400的单通道黑色图像= imread("添加图片路径");
vector<Point2f> vert(6);//定义6个点坐标
vert[0] = Point(3 * r / 2, static_cast<int>(1.34*r));
vert[1] = Point(1 * r, 2 * r);
vert[2] = Point(3 * r / 2, static_cast<int>(2.866*r));
vert[3] = Point(5 * r / 2, static_cast<int>(2.866*r));
vert[4] = Point(3 * r, 2 * r);
vert[5] = Point(5 * r / 2, static_cast<int>(1.34*r));
for (int i = 0; i < 6; i++) {//将6个点坐标连接成一个多边形
line(src, vert[i], vert[(i + 1) % 6], Scalar(255), 3, 8, 0);
}
vector<vector<Point>> contours;
vector<Vec4i> hierachy;
Mat csrc;
src.copyTo(csrc);
findContours(csrc, contours, hierachy, RETR_TREE, CHAIN_APPROX_SIMPLE, Point(0, 0));
Mat raw_dist = Mat::zeros(src.size(), CV_32FC1);
for (int row = 0; row < raw_dist.rows; row++) {
for (int col = 0; col < raw_dist.cols; col++) {
double dist = pointPolygonTest(contours[0], Point2f(static_cast<float>(col), static_cast<float>(row)), true);//测试图像中每一个点离给定轮廓的距离值
raw_dist.at<float>(row, col) = static_cast<float>(dist);//raw_dist中每个像素位置处存储的是该点离轮廓的距离
}
}
j
double minValue, maxValue;
minMaxLoc(raw_dist, &minValue, &maxValue, 0, 0, Mat());//在raw_dist中找到距离最大最小值
Mat dst = Mat::zeros(src.size(), CV_8UC3);
for (int row = 0; row < dst.rows; row++) {
for (int col = 0; col < dst.cols; col++) {
float dist = raw_dist.at<float>(row, col);//遍历raw_dist每一个位置处存储的值
if (dist > 0) {
dst.at<Vec3b>(row, col)[0] = (uchar)(abs(dist / maxValue) * 255);//确保在0-255之间
//dst.at<Vec3b>(row, col)[0] = (uchar)((1 - abs(dist / maxValue)) * 255);//输出相反的效果,像素值与距离成反比
} else if (dist < 0) {
dst.at<Vec3b>(row, col)[2] = (uchar)(abs(dist / minValue) * 255);
//dst.at<Vec3b>(row, col)[2] = (uchar)((1 - abs(dist / minValue)) * 255);//输出相反的效果,像素值与距离成反比
} else {
dst.at<Vec3b>(row, col)[0] = (uchar)(abs(255 - dist));
dst.at<Vec3b>(row, col)[1] = (uchar)(abs(255 - dist));
dst.at<Vec3b>(row, col)[2] = (uchar)(abs(255 - dist));
}
}
}
const char* output_win = "point poly test demo";
char input_win[] = "input image";
namedWindow(input_win, WINDOW_AUTOSIZE);
namedWindow(output_win, WINDOW_AUTOSIZE);
imshow(input_win, src);
imshow(output_win, dst);
waitKey(0);
return 0;
}
输出结果显示:
像素值与距离成正比
像素值与距离成反比