/*******************************************************
测试程序【寻找轮廓凸壳】
时间:2016年9月3日
* threshold( src_gray, threshold_output, thresh, 255, THRESH_BINARY );
* findContours( threshold_output, contours, hierarchy, CV_RETR_TREE, CV_CHAIN_APPROX_SIMPLE, Point(0, 0) );
* vector<vector<Point> >hull( contours.size() );
* onvexHull( Mat(contours[i]), hull[i], false );
********************************************************/
Mat src; Mat src_gray;
int thresh = 100;
int max_thresh = 255;
RNG rng(12345);
void thresh_callback(int, void* );
int main(void)
{
src = imread("hand_sample2.jpg", 1 );
cvtColor( src, src_gray, COLOR_BGR2GRAY );
blur( src_gray, src_gray, Size(3,3) );
const char* source_window = "Source";
namedWindow( source_window, WINDOW_AUTOSIZE );
imshow( source_window, src );
createTrackbar( " Threshold:", "Source", &thresh, max_thresh, thresh_callback );
thresh_callback( 0, 0 );
waitKey(0);
return(0);
}
//【阈值回调函数】
void thresh_callback(int, void* )
{
Mat src_copy = src.clone();
Mat threshold_output;
vector<vector<Point> > contours;
vector<Vec4i> hierarchy;
//【1、阈值检测边缘】 Detect edges using Threshold
threshold( src_gray, threshold_output, thresh, 255, THRESH_BINARY );
//【2、findContours】
findContours( threshold_output, contours, hierarchy, CV_RETR_TREE, CV_CHAIN_APPROX_SIMPLE, Point(0, 0) );
//【3、每一个轮廓对象的凸壳】
vector<vector<Point> >hull( contours.size() );
for( size_t i = 0; i < contours.size(); i++ )
{
//参数:输入数组,输出数组,逆时针
convexHull( Mat(contours[i]), hull[i], false );
}
//【4、绘制轮廓 + 凸壳】
Mat drawing = Mat::zeros( threshold_output.size(), CV_8UC3 );
for( size_t i = 0; i< contours.size(); i++ )
{
Scalar color = Scalar( rng.uniform(0, 255), rng.uniform(0,255), rng.uniform(0,255) );
drawContours( drawing, contours, (int)i, color, 1, 8, vector<Vec4i>(), 0, Point() );
drawContours( drawing, hull, (int)i, color, 1, 8, vector<Vec4i>(), 0, Point() );
}
namedWindow( "Hull demo", WINDOW_AUTOSIZE );
imshow( "Hull demo", drawing );
}
【opencv练习33 - 寻找轮廓凸壳】
最新推荐文章于 2023-12-07 19:27:03 发布