登录
首页 » Visual C++ » canny

canny

于 2013-10-11 发布 文件大小:2916KB
0 179
下载积分: 1 下载次数: 7

代码说明:

  opencv实现canny边缘检测。。。。。。。(opencv realize canny edge detection)

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

发表评论

0 个回复

  • MT4ExpertAdvisor
    MT4智能交易系统 学习指导教程,中文版本。(MT4 Expert Advisors learning tutorials, the Chinese version.)
    2020-07-23 21:38:44下载
    积分:1
  • zuixiaofei-zuidaliu
    文件中包括了最优化中的最小费最大流程序以及例子和程序(File included in the most optimal maximum flow procedures and examples of trees and procedures)
    2014-07-17 09:54:20下载
    积分:1
  • WindowsCEqudong
    Windows CE下驱动程序开发基础,   Windows CE下的串口驱动程序能够处理所有I/O行为类似串口的设备,包括基于16450、16550 UART(通用异步收发芯片)的设备和一些采用DMA的设备,常见的有9针串口、红外I/O口、Modem等(Windows CE Driver Development under the foundation, Windows CE under the serial driver to handle all I/O behavior similar to serial devices, including those based on 16450,16550 UART (Universal Asynchronous Receiver-chip) devices and some of the equipment used DMA common 9-pin serial port, infrared I/O port, Modem, etc.)
    2007-11-01 05:46:38下载
    积分:1
  • Project4_BallmanFord
    (图论)实现负权重转换(Bellman-Ford) 对于输入的任何一个拓扑(部分边的权重为负),要求变换网络中边的权重,任意两节点间的最短路不变,输出变换后各边权重。如果网络中存在负环,程序要有报警功能。算法主体写在CGraph类中((Graph theory) to achieve negative weight conversion (Bellman-Ford) to the input of any topology (some edge weight is negative), requiring transform the network edge weights between any two nodes of the shortest path unchanged, the output transform each edge weights. If the negative loop exists in the network, the program should alarm function. Algorithms written in CGraph class body)
    2020-08-03 17:48:35下载
    积分:1
  • circle
    a simple graphics application
    2014-02-06 14:23:28下载
    积分:1
  • zoj1094
    zoj094 Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. (Matrix multiplication problem is a typical example of dynamical programming. Suppose you have to evaluate an expression like A*B*C*D*E where A,B,C,D and E are matrices. Since matrix multiplication is associative, the order in which multiplications are performed is arbitrary. However, the number of elementary multiplications needed strongly depends on the evaluation order you choose. For example, let A be a 50*10 matrix, B a 10*20 matrix and C a 20*5 matrix. There are two different strategies to compute A*B*C, namely (A*B)*C and A*(B*C). The first one takes 15000 elementary multiplications, but the second one only 3500. Your job is to write a program that determines the number of elementary multiplications needed for a given evaluation strategy. )
    2012-06-10 10:38:53下载
    积分:1
  • cd
    说明:  <最优化及matlab的应用>课后题的编程(Most optimized operating)
    2013-10-20 07:46:40下载
    积分:1
  • PID0001
    PID比例积分微分控制程序包 神经网络自适应控制程序
    2010-12-18 17:12:44下载
    积分:1
  • GDI
    说明:  利用GDI编写图形处理功能,具有一定图形功能.(Prepared using GDI graphics processing functions, with certain graphics features.)
    2008-11-16 14:29:27下载
    积分:1
  • sdkdemo
    这篇则是面向对象技术篇,当然还是老调重提!不过我们是利用面向对象技术实现Windows的SDK开发,对于刚开始学习Win32 SDK的VcKbase的朋友们,你们一定可以在此获益!(This is the object-oriented technology, a chapter of course, the old tune again! But we are using object-oriented technology for Windows SDK development, For just started learning Win32 SDK VcKbase friends, you will be able to benefit from this!)
    2007-05-16 16:23:28下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载