博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
Opencv Hello World
阅读量:5322 次
发布时间:2019-06-14

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

VS2013 + OpenCV-2.4.13

配置:

1、系统环境变量

D:\opencv\opencv\build\x86\vc12\bin
2、VC++ 目录
包含目录:
D:\opencv\opencv\build\include
库目录:
D:\opencv\opencv\build\x86\vc12\lib
3、连接器->输入->附加依赖项
Release
opencv_calib3d2413.lib;
opencv_contrib2413.lib;
opencv_core2413.lib;
opencv_features2d2413.lib;
opencv_flann2413.lib;
opencv_gpu2413.lib;
opencv_highgui2413.lib;
opencv_imgproc2413.lib;
opencv_legacy2413.lib;
opencv_ml2413.lib;
opencv_nonfree2413.lib;
opencv_objdetect2413.lib;
opencv_ocl2413.lib;
opencv_photo2413.lib;
opencv_stitching2413.lib;
opencv_superres2413.lib;
opencv_ts2413.lib;
opencv_video2413.lib;
opencv_videostab2413.lib;
Debug
opencv_calib3d2413d.lib;
opencv_contrib2413d.lib;
opencv_core2413d.lib;
opencv_features2d2413d.lib;
opencv_flann2413d.lib;
opencv_gpu2413d.lib;
opencv_highgui2413d.lib;
opencv_imgproc2413d.lib;
opencv_legacy2413d.lib;
opencv_ml2413d.lib;
opencv_nonfree2413d.lib;
opencv_objdetect2413d.lib;
opencv_ocl2413d.lib;
opencv_photo2413d.lib;
opencv_stitching2413d.lib;
opencv_superres2413d.lib;
opencv_ts2413d.lib;
opencv_video2413d.lib;
opencv_videostab2413d.lib;

测试:

#include 
#include
using namespace std;using namespace cv;int main(int argc, char **argv){ Mat img = imread("lena.png"); if (img.empty()) { cout << "打开图像失败!" << endl; return -1; } namedWindow("image", CV_WINDOW_AUTOSIZE); imshow("image", img); waitKey(); return 0;}

转载于:https://www.cnblogs.com/lgh1992314/p/6616302.html

你可能感兴趣的文章
洛谷 P5057 [CQOI2006]简单题(树状数组)
查看>>
19年SD夏令营游记
查看>>
洛谷 P1886 滑动窗口(单调队列)
查看>>
洛谷 P1241 括号序列(栈)
查看>>
递归练习
查看>>
洛谷 P1168 中位数(优先队列)
查看>>
洛谷 P1339 [USACO09OCT]热浪Heat Wave(最短路)
查看>>
HDU 1372 Knight Moves(bfs)
查看>>
POJ 3984 迷宫问题(bfs)
查看>>
HDU 1035 Robot Motion(dfs + 模拟)
查看>>
POJ 1274 The Perfect Stall(二分图 && 匈牙利 && 最小点覆盖)
查看>>
HDU 1312 Red and Black(经典DFS)
查看>>
POJ 1064 Cable master(二分答案)
查看>>
POJ 1061 青蛙的约会(exgcd)
查看>>
ZOJ 1002 Fire Net(dfs)
查看>>
HDU 1016 素数环(dfs + 回溯)
查看>>
POJ 2142 The Balance(exgcd)
查看>>
POJ 3041 Asteroids(二分图 && 匈牙利算法 && 最小点覆盖)
查看>>
洛谷 P1880 [NOI1995]石子合并(区间DP)
查看>>
HDU 2063 过山车(二分图 && 匈牙利 && 最小点覆盖)
查看>>