登录
首页 » C++ » image_canny_gray

image_canny_gray

于 2011-05-11 发布 文件大小:118KB
0 93
下载积分: 1 下载次数: 5

代码说明:

  opencv將彩色影像轉成灰階和canny並存檔(opencv convert color images to grayscale and canny and archive)

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

发表评论

0 个回复

  • code
    The RAMDISK is made to look like a hard drive. Consequently, the class is "hdc". The class install section points the section containing Registry entries for the class. On many machines, this is already present.
    2010-06-11 21:36:43下载
    积分:1
  • CAN
    飞思卡尔CAN扩展帧通信,Can盒发送数据,单片机接受并返回数据(The Carle CAN extended frame communication, Can box to send data, the microcontroller to accept and return data )
    2020-09-21 00:47:56下载
    积分:1
  • VC通信000783
    说明:  串口通信F路易斯要要要村艺术节南极区茜 苛栽植工基本原理工工要(Serial Communication F Louis to the village to an arts festival Ure harsh Antarctic area planted for the basic tenets of workers to work)
    2006-01-20 17:45:51下载
    积分:1
  • cdmaguo
    这是MATLAB工具箱,用来实现波形的生产!(This is the MATLAB toolbox, which can be used for the production of wave!)
    2007-04-24 21:46:48下载
    积分:1
  • Internetdisk
    C++.NET网络与通信高级编程范例》光盘(C++.NET disk)
    2009-12-10 14:16:59下载
    积分:1
  • SX1280-STM32F1测距主从机
    说明:  stm32f1驱动sx1280进行测距,通过oled或串口打印输出距离(Stm32f1 driver sx1280 range, through oled or serial port printing output distance)
    2020-04-19 20:07:27下载
    积分:1
  • router
    运用linux系统、arm-A8开发板、C语言开发的一个简单的能够实现路由器功能的程序。(Use of Linux system, the arm- A8 development board, a simple C language development to realizing the function of the router process.)
    2020-12-29 09:59:00下载
    积分:1
  • H.264
    H.264视频压缩标准,白皮书,分块讲解了编码和nal过程,很详尽,准确无误,适合做H.264研究者使用(H. 264 video compression standard, white paper, explained the coding block and nal process, very detailed, accurate and suitable for h. 264 researchers to use)
    2013-12-06 17:21:07下载
    积分:1
  • Graph
    输入一个带权无向图的顶点数、边数、各条边信息(两个顶点和权值),建立该图的邻接矩阵结构,输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构,输出该邻接表;根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列,并输出遍历结果;用prim算法实现构造该带权无向图的最小生成树,并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)
    2020-12-13 15:29:15下载
    积分:1
  • ActivX控件 分享 selfs.CAB
    ActivX控件集成多种工具
    2014-08-15下载
    积分:1
  • 696518资源总数
  • 105559会员总数
  • 1今日下载