登录
首页 » Visual C++ » ObjectDetectionContours

ObjectDetectionContours

于 2013-10-19 发布 文件大小:3347KB
0 108
下载积分: 1 下载次数: 5

代码说明:

  Object detecttion using contour .Here is the code using openCV and Microsoft Visual Studio

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • code
    數學function的用法 這個使用的方法對於數學界很重要 提供function使得 很多人不用在自己寫的很痛苦(ceiling method)
    2010-01-18 16:15:12下载
    积分:1
  • GetNetSetting
    get your host net setting
    2012-10-25 12:48:22下载
    积分:1
  • SDK-APIs
    OK卡最新开发包,6.51. 包含OKDemo演示代码,及编程手册说明。(OKCard 6.51 SDK, including programming manual.)
    2012-02-15 09:42:43下载
    积分:1
  • multiview
    VC++实现 multiview多视图窗口的实例源代码,可看到打开窗体时有几个子窗体随主窗口一起打开,如果你不知道这是怎么创建的,那么你需要本源码为你提供参考。源码在VC6.0下可顺利编译。如果初次编译有误,你可重新编译一下即可正常。(VC++ implementation source code examples multiview multi-view window, you can see there are several sub-forms together with the main window opens, if you do not know how to create, then you need to provide a reference for the source when you open the form. Source code can be compiled successfully under VC6.0. If the initial compilation is incorrect, you can recompile to normal.)
    2014-06-03 14:46:24下载
    积分:1
  • HoughMFC
    用OpenCV进行图像处理与工程开发的一个入门示例程序——Hough变换,效果不错(using OpenCV for image processing and development of a project portal sample program-- Hough Transform good results!)
    2006-11-03 21:15:57下载
    积分:1
  • knignt
    求解骑士游历问题的程序。骑士游历问题是在8X8格的国际象棋棋盘上随意放置一个马,按照马走“日”字的规则对马进行操作,问是否能够不重复的走遍棋盘的每个格。(Cavaliers traveled problem solving process. Cleveland traveled problem is the 8x8 grid of international chess pieces on dumped a horse, according to Ma take "days" to the rules word for horse operations, asked whether not to repeat the chessboard visited each grid.)
    2006-06-02 17:04:37下载
    积分:1
  • BankSystem
    用c#实现模拟银行系统 控制台界面 实现取款 存款 之类的一些基本操作 (With c# console interface for analog banking system deposits, withdrawals and the like to achieve some of the basic operations)
    2020-09-18 21:17:53下载
    积分:1
  • HookQQ-master
    说明:  msimg32 hook dll for any program
    2020-06-14 12:21:33下载
    积分:1
  • FreeTree
    无环连通图G=(V, E)亦称为自由树T,其直径是树中所有顶点之间最短路径的最大值,设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
    2013-10-29 16:31:47下载
    积分:1
  • 9E
    说明:  职工信息管理系统职工信息管理系统职工信息管理系统(Information management system foremployees)
    2009-02-17 10:15:45下载
    积分:1
  • 696518资源总数
  • 106164会员总数
  • 18今日下载