登录
首页 » Visual C++ » chamfermatching

chamfermatching

于 2013-11-25 发布 文件大小:9KB
0 312
下载积分: 1 下载次数: 14

代码说明:

  Description of the file: template matching source of Chamfer matching algorithm. It s OpenCV implementation

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

发表评论

0 个回复

  • yui_v57
    分数阶傅里叶变换计算方面,线性调频脉冲压缩的Matlab程序,包含收发两个客户端程序。( Fractional Fourier transform computing, LFM pulse compression of the Matlab program, Transceiver contains two client programs.)
    2017-04-25 19:40:04下载
    积分:1
  • apm--project
    现在飞的稳定的apm给空的源代码,,可以提供参考(apm is project,)
    2014-08-19 17:53:55下载
    积分:1
  • APMTMLHDGV01Ver2001
    APMTMLHDGV01Ver2001_Tools_Software_general_05011YXC.rar华为手机刷机平台(Tools Software general )
    2014-09-10 21:02:40下载
    积分:1
  • MATLABC-C
    MATLABC数学函数库在C语言中的应用(MATLABC math library in C language)
    2012-10-08 10:08:01下载
    积分:1
  • Inertial-navigation
    这是一本秦永元关于惯性导航的书籍。该书系统地讲解了导航的基础知识。(This is an inertial navigation ROCKETS about books. The book systematically explains the basics of navigation.)
    2015-03-07 10:51:16下载
    积分:1
  • 2
    说明:   有一个长度为整数L(1<=L<=10000)的马路,可以想象成数轴上长度为L的一个线段,起点是坐标原点,在每个整数坐标点有一棵树,即在0,1,2,...,L共L+1个位置上有L+1棵树。 现在要移走一些树,移走的树的区间用一对数字表示,如 100 200表示移走从100到200之间(包括端点)所有的树。 可能有M(1<=M<=100)个区间,区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入: 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数,每组有一对数字。 输出: 可能有多组输入数据,对于每组输入数据,输出一个数,表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)
    2015-03-22 23:35:47下载
    积分:1
  • SLAM_plus_plus_v1.13
    Slam written in c++
    2015-03-04 19:53:44下载
    积分:1
  • DC_Power_flow
    利用奇诺多面体描述光伏发电出力的不确定性(The Chino polytopic description photovoltaic power generation uncertainty)
    2017-08-26 10:22:48下载
    积分:1
  • 1
    FFT 与LZW编码算法相结合,实现压缩功能,MATLAB仿真实现(FFT LZW compress)
    2013-11-20 22:11:22下载
    积分:1
  • net
    微分方程网格生成 计算传热学 离散方法 自适应网格(The differential equation of grid generation)
    2014-01-02 13:57:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载