登录
首页 » Visual C++ » opencv_test

opencv_test

于 2013-09-11 发布 文件大小:2322KB
0 120
下载积分: 1 下载次数: 3

代码说明:

  opencv mfc 非常不错的视频 大家可以下载看看(opencv mfc is very good)

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

发表评论

0 个回复

  • Visual-CPPand-Matlab
    数字图象处理与机器视觉Visual C++与Matlab实现,光盘源代码(Digital image processing and machine vision Visual C++ with Matlab, CD-ROM source code)
    2013-12-24 12:02:43下载
    积分:1
  • laplace
    说明:  基于win32控制台程序,能对视频文件以及摄像头的图像进行经典的Laplace边缘检测(Based on win32 console programs, capable of video files, as well as camera images the classic Laplace edge detection)
    2009-09-01 16:04:33下载
    积分:1
  • 四机两区
    粒子群优化算法计算出的PSS优化模型,为四机两区模型(PSS optimization model calculated by particle swarm optimization algorithm)
    2020-12-30 00:09:00下载
    积分:1
  • chuankouhuaqux
    说明:  串口画实时曲线,基于com控件的温湿度采集系统设计(Serial real-time curve of paintings, based on the com acquisition of temperature and humidity control system design)
    2008-10-18 15:07:36下载
    积分:1
  • Speechrecognition
    说明:  一个不错的语音识别系统,里面可以通过端口进行机器人的机器人控制,是学习语言识别的好工具(A good voice recognition system, which can be carried out through the port robot robot control, speech recognition is a good tool for learning)
    2010-04-23 11:58:42下载
    积分:1
  • kuandai
    这是学习麦克风阵列信号处理的好资料,希望大家会喜欢。(this is good book ,you will need for yourself ,i hope you will like it.)
    2014-11-02 18:09:39下载
    积分:1
  • erchashu
    二叉树的链式存储、先序中序遍历和层次遍历。(构造一棵树并输入数据,编写三个函数,非别是树的前序递归遍历算法、树的后序递归遍历算法、树的非递归中序遍历算法(这里的非递归以中序为例)。在主程序中调用这三个函数进行树的遍历,观察用不同的遍历方法输出的数据的顺序和验证递归与非递归输出的数据是否一样。)(Chain store binary tree, preorder traversal and hierarchy traversal.)
    2013-12-07 23:16:06下载
    积分:1
  • permanent-calendar
    用c语言编写万年历程序,日历和时间可以随着时间的变化而变化。(C language calendar program, calendar and time can be changed over time.)
    2013-04-30 06:29:59下载
    积分:1
  • 钻石矿工
    算法设计中的钻石矿工问题在一座金字塔每块石头上都镶有一块钻石从金字塔的顶端向下收集钻石尽可能收集价值高的钻石,每层每次只能从一块砖斜向左下或斜向右下走到另一块砖上。设计算法求出获取的钻石最大价值及路径。(动态规划)(The problem of diamond miner in algorithm design is set up on every stone in Pyramid. A diamond is collected from the top of Pyramid. Diamond is collected as high as possible. Every layer can only lean from one brick to the left or to the right to go to the next brick at a time. The design algorithm is used to find the maximum value and path of the obtained diamond. (dynamic programming))
    2020-10-21 08:37:24下载
    积分:1
  • ECET
    三轴联动数控上位机控制程序,基于美国PARKER运动控制器,适合数控学者使用(Axis linkage CNC PC control program, based on the United States PARKER motion controller for CNC scholars)
    2012-09-28 21:30:21下载
    积分:1
  • 696516资源总数
  • 106442会员总数
  • 11今日下载