登录
首页 » matlab » hough_circle

hough_circle

于 2012-04-16 发布 文件大小:1KB
0 189
下载积分: 1 下载次数: 23

代码说明:

  边缘提取,能方便获得边缘坐标,较为准确的边缘提取方法(Edge detection, ease of access to the edge of coordinates, the more accurate edge detection methods)

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

发表评论

0 个回复

  • Q123
    一个很好的Q学习源码,对于学习强化学习有很大的作用。(Q-learning a good source for learning reinforcement learning has a significant role.)
    2011-05-31 22:43:58下载
    积分:1
  • FDM-any-accuracy
    电磁波、声波或地震波等数值模拟中常常会用到有限差分法,但是很多文章都只是泛泛而谈时间2阶,空间4阶等等如何用公式,本文给出了任意阶精度的泰勒展开与迭代公式。(Numerical simulation of electromagnetic, acoustic or seismic waves will often use the finite difference method, but many articles are just generalities time two bands, space, etc. How to order 4 formula, this paper presents the accuracy of any order Taylor expansion and iterative formula.)
    2015-01-31 00:10:02下载
    积分:1
  • 龙格库塔
    龙格库塔算法Runge-Kutta,包括二阶到四阶的MATLAB程序。(Runge-Kutta MATLAB 123456)
    2019-03-07 19:22:43下载
    积分:1
  • err
    说明:  无线传感器网络中一种定位技术apit协议的修改于实现(APIT)
    2009-07-28 23:19:19下载
    积分:1
  • matlab
    说明:  建立一数据文件magic5.dat,用于存放5阶魔方阵。(The establishment of a data file magic5.dat, used to store 5-order magic square.)
    2011-04-12 11:27:01下载
    积分:1
  • Juliass2YMDhmsV2
    将距某年开始的总秒数转换为当前的年月日时分秒(The conversion from the total number of seconds in a year to date at the beginning of every minute)
    2014-08-12 12:34:12下载
    积分:1
  • loop12
    是一个关于动画的程序,描述的是箭击,百步穿杨(Is a program of animation, describes the arrow hit, shoot with great precision)
    2011-10-30 10:17:21下载
    积分:1
  • ts_102223v120100p
    card application spec
    2015-01-08 15:16:34下载
    积分:1
  • riritur
    捕鱼和分鱼;用逆推法求EX=1+x+x.x/2!+x.x.x/3!......的值;找出一个二维数组的“鞍点”(fishing and the fish; Backstepping method used for EX x.x x = 1/2! x.x.x/3 !...... value; find a two-dimensional array of the "saddle")
    2006-12-28 07:18:15下载
    积分:1
  • M
    说明:  字典树的基本功能是用来查询某个单词(前缀)在所有单词中出现次数的一种数据结构,它的插入和查询复杂度都为O(len),Len为单词(前缀)长度,但是它的空间复杂度却非常高,如果字符集是26个字母,那每个节点的度就有26个,典型的以空间换时间结构。(The basic function of the dictionary tree data structure is used to query a number of times a word (prefix) appears in all the words, which insertion and query complexity are O (len), Len is a word (prefix) length, but its space complexity is very high, if the character set is 26 letters, and that the degree of each node will have 26, the typical structure of space for time.)
    2013-11-29 14:28:52下载
    积分:1
  • 696516资源总数
  • 106459会员总数
  • 0今日下载