登录
首页 » Visual C++ » OpenCV-Cookbook

OpenCV-Cookbook

于 2015-01-08 发布 文件大小:5654KB
0 271
下载积分: 1 下载次数: 2

代码说明:

  OpenCV 2 Computer Vision Application Programming Cookbook

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

发表评论

0 个回复

  • DiskGenius
    基础学习,可以实现编码的基础学习,认真学习还是可以学很好的(Based learning, can achieve coding based learning, serious learning can still learn a good)
    2015-03-28 10:51:32下载
    积分:1
  • linear_equation_with_one_unkown
    MATLAB—linear equation with one unkown(linear equation with one unkown)
    2010-05-23 17:18:41下载
    积分:1
  • Cycles
    three LCCWIN-32 macro-implementations for measuring cpu-cycles:
    2014-11-12 02:27:45下载
    积分:1
  • fenzhi
    #include <iostream.h> int main() { int i(0),sum(0) while (i<=100) { sum=sum+i ++i }cout<<"sum="<<sum<<endl return 0; }
    2009-12-11 22:03:44下载
    积分:1
  • Cognitive-Radar-Theory-
    雷达系统的理论和设计一直占主导地位 概率论与统计,信息理论,信号处理和控制 然而,类似的编码译码的属性之间存在的视觉 BIAM和雷达已经黯然忽视的m所有雷达系统(For over six decades, the theory and design of radar systems have been dominated by probability theory and statistics, information theory, signal processing and control However, the similar encoding-decoding property that exists between the visual biam and radar has been sadly overlooked m all radar systems)
    2013-09-09 20:22:52下载
    积分:1
  • LL1
    能够实现LL(1)预测分析过程的源码,有测试用例(To achieve LL (1) Prediction of the process of source code, there are test cases)
    2020-06-30 08:40:01下载
    积分:1
  • PingOriginal_MikeMuuss_1983
    Ping original program. implement pinging test
    2014-10-10 12:33:30下载
    积分:1
  • FilterTitleOverlay
    FilterTitleOverlay字幕叠加的filter(FilterTitleOverlay subtitles superimposed filter)
    2014-01-23 08:03:52下载
    积分:1
  • 0
    说明:  给定n种物品和一个背包,物品i的重量是Wi,价值是vi,被包容量是C,应该如何选择装入被包的物品,使得装入背包中物品的总价值最大?对于每种物品i,只有两种选择,装入或者不装入. 输入:第一行两个正整数n(物品数)和C(容量) 第二行n个正整数n,表示物品价值 第三行n个正整数n,表示物品重量 输出:第一行表示总价值 第二行n个数(0/1),0表示物品不装入,1表示装入 例如, 输入: 5 10 6 3 5 4 6 2 2 6 5 4 输出 15 1 1 0 0 1 (Species of a given n items and a backpack, the weight of item i is Wi, the value of vi, was packet capacity is C, should be how to choose a package of items to be loaded, the backpack load in the largest total value of goods? For each item i, there are only two options, loaded or not loaded. Input: the first line of the two positive integer n (the number of items) and C (capacity) of the second line of n positive integer n, that the value of the third line of n positive integer n, that the weight of output: the total value of the first line of the second line, said n number of (0/1), 0 that the items do not load, that load 1 for example, enter: 5,106,354,622 6 5 4 output 15 1 1 0 0 1)
    2009-07-01 23:07:01下载
    积分:1
  • heatmaps
    教你如何做热图(heatmap),可以显示图像的百分比。(A mathod to tell you how to make a heatmap.)
    2014-11-01 14:08:47下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载