博客
关于我
ROS:OpenCV canny边缘检测
阅读量:332 次
发布时间:2019-03-04

本文共 1434 字,大约阅读时间需要 4 分钟。

???????ROS?OpenCV???????????????????????????????????????????????????????????????????????????????

????????????OpenCV?????????????CMakeLists.txt??????????????OpenCV?????????????????????OpenCV??????????

???????????????????

#include 
#include
#include
#include
#include
using namespace cv;

????????????using namespace cv;?????????????????????????????????cv::?????OpenCV??????????????????????????using namespace cv;??????cv::blur????????????????????????????

?????????????????OpenCV?????????????????????????????????????????????CMakeLists.txt???????????????????

find_package(OpenCV REQUIRED)target_link_libraries(cannyproc ${catkin_LIBRARIES} ${OpenCV_LIBRARIES})

???????????????????OpenCV??????????????????????????????????????cv::????????????????????

???????????????????????OpenCV??????????using namespace cv;??????????????cv::?????????

cv::blur(edges, edges, Size(7, 7));

???????????????????????????????????????????????????????????????????????????

???????????ROS??????????????????????????image_transport::Publisher?image_transport::ImageTransport????????????cv::Mat????????sensor_msgs/Image????????????????????

???????????????????ROS?????????????????????????????????????????????????

???????????????ROS?OpenCV???????????CMakeLists.txt???????????????????????????????using namespace cv;???????cv::?????????????????????

????????????????????????????????????????????

转载地址:http://waxq.baihongyu.com/

你可能感兴趣的文章
poj 1258 Agri-Net
查看>>
poj 1286 Necklace of Beads
查看>>
POJ 1321 棋盘问题
查看>>
poj 1321(回溯)
查看>>
Qt读取注册表默认值
查看>>
poj 1679 判断MST是不是唯一的 (次小生成树)
查看>>
POJ 1703 Find them, Catch them
查看>>
POJ 1703 Find them, Catch them 并查集
查看>>
POJ 1738 An old Stone Game(石子合并)
查看>>
POJ 1740 A New Stone Game(博弈)题解
查看>>
Qt网络编程之实例二POST方式
查看>>
POJ 1765 November Rain
查看>>
poj 1860 Currency Exchange
查看>>
POJ 1961 Period
查看>>
POJ 2019 Cornfields (二维RMQ)
查看>>
poj 2057 The Lost House 贪心思想在动态规划上的应用
查看>>
poj 2057 树形DP,数学期望
查看>>
poj 2112 最优挤奶方案
查看>>
Qt编写自定义控件12-进度仪表盘
查看>>
poj 2186 Popular Cows :求能被有多少点是能被所有点到达的点 tarjan O(E)
查看>>