获取任意一张图像中，多个矩阵图形的质心及其像素面积

获取任意一张图像中，多个矩阵图形的质心及其像素面积

// The “Square Detector” program.
// It loads several images sequentially and tries to find squares in
// each image

#include “opencv2/core/core.hpp”
#include “opencv2/imgproc/imgproc.hpp”
#include “opencv2/highgui/highgui.hpp”

#include
#include <math.h>
#include <string.h>

using namespace cv;
using namespace std;

typedef struct Result
{
float location[10][2];
float totalarea[10];
}Result;

static double angle(Point pt1, Point pt2, Point pt0)
{
double dx1 = pt1.x - pt0.x;
double dy1 = pt1.y - pt0.y;
double dx2 = pt2.x - pt0.x;
double dy2 = pt2.y - pt0.y;
return (dx1dx2 + dy1dy2) / sqrt((dx1dx1 + dy1dy1)(dx2dx2 + dy2*dy2) + 1e-10);
}

static struct Result findSquares(const Mat& image, vector<vector >& squares)
{

struct  Result myresult;


int thresh = 100, N = 5;
const char* wndname = "Square Detection Demo";

int count = 0;
squares.clear();

//用于装质心像素坐标的容器，由于能捕捉多个质心，我用的图片中的质心数目为4，所
//以先定义大一点的，再筛选
vector mc1oc(10);
//float totalarea[10];

//并进行模糊降噪
Mat timg(image);
medianBlur(image, timg, 9);
Mat gray0(timg.size(), CV_8U), gray;

vector<vector<Point> > contours;

// find squares in every color plane of the image
for (int c = 0; c < 3; c++)
{

	int ch[] = { c, 0 };

	//三个通道，分别为色相、饱和度、色调通道；
	mixChannels(&timg, 1, &gray0, 1, ch, 1);

	// try several threshold levels
	for (int l = 0; l < N; l++)
	{
		// hack: use Canny instead of zero threshold level.
		// Canny helps to catch squares with gradient shading
		if (l == 0)
		{
			// apply Canny. Take the upper threshold from slider
			// and set the lower to 0 (which forces edges merging)
			Canny(gray0, gray, 5, thresh, 5);
			// dilate canny output to remove potential
			// holes between edge segments
			dilate(gray, gray, Mat(), Point(-1, -1));
		}
		else
		{
			// apply threshold if l!=0:
			//     tgray(x,y) = gray(x,y) < (l+1)*255/N ? 255 : 0
			gray = gray0 >= (l + 1) * 255 / N;
		}

		// find contours and store them all as a list
		findContours(gray, contours, RETR_LIST, CHAIN_APPROX_SIMPLE);

		vector<Point> approx;

		//定义轮廓矩
		vector<Moments> mu(contours.size());
		//定义
		vector<Point2f> mc(contours.size());

		// 对每一个轮廓进行测试
		for (size_t i = 0; i < contours.size(); i++)
		{


			//多边形拟合
			approxPolyDP(Mat(contours[i]), approx, arcLength(Mat(contours[i]), true)*0.02, true);

			
			// 矩形满足有四个顶点，且有足够的像素面
			if (approx.size() == 4 &&
				fabs(contourArea(Mat(approx))) > 1000 &&
				isContourConvex(Mat(approx)))
			{
				double maxCosine = 0;

				for (int j = 2; j < 5; j++)
				{
					// find the maximum cosine of the angle between joint edges
					double cosine = fabs(angle(approx[j % 4], approx[j - 2], approx[j - 1]));
					maxCosine = MAX(maxCosine, cosine);
				}

				// 顶点上角的余弦值都能接近0，即满足均为直角
			
				if (maxCosine < 0.3) {
					squares.push_back(approx);
					//计算轮廓矩       
					mu[i] = moments(contours[i], false);
					//计算轮廓的质心     	
					mc[i] = Point2d(mu[i].m10 / mu[i].m00, mu[i].m01 / mu[i].m00);

					if (mu[i].m10 > 0 && mu[i].m01 > 0) {
						if (count < mc1oc.size()) {
							mc1oc[count] = Point2d(mu[i].m10 / mu[i].m00, mu[i].m01 / mu[i].m00);
						//面积
							myresult.totalarea[count] = contourArea(Mat(approx));	
							myresult.location[count][1] = mc1oc[count].x;
							myresult.location[count][2] = mc1oc[count].y;
							count = count + 1;
						}
					}
				}
			}

		}
	}
	
}
/*for (int j = 0; j < count; j++) {
	cout << myresult.totalarea[j] << endl;
}
cout << "质心坐标分别为： " << count << endl;*/
return myresult;