登录
首页 » 算法 » Harris焦点检测

Harris焦点检测

于 2022-03-19 发布 文件大小:4.16 kB
0 166
下载积分: 2 下载次数: 1

代码说明:

提供图像焦点检测程序,其中包括了Harris角点检测方法以及它的改进方法; 该程序为一个C++类,可以一直到任何C++程序中; 其中使用了GDAL 库,请下载GDAL库后配置后使用。

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

发表评论

0 个回复

  • 二维码编解码的C++实现
    QR二维码生成器与解码器的C++实现,其中QREncode.zip压缩文件是生成器,QRcodeDecode.zip文件是解码器,文件是完整的,在VC++环境下编译可以直接通过。
    2022-07-15 15:55:19下载
    积分:1
  • 分词以及词性标注
    中文词法分析是中文信息处理的基础与关键。中国科学院计算技术研究所在多年研究工作积累的基础上,研制出了汉语词法分析系统ICTCLAS(Institute of Computing Technology, Chinese Lexical Analysis System),主要功能包括中文分词;词性标注;命名实体识别;新词识别;同时支持用户词典。实验的核心思想利用系统 请点击左侧文件开始预览 !预览只提供20%的代码片段,完整代码需下载后查看 加载中 侵权举报
    2022-01-26 02:18:22下载
    积分:1
  • 数值有原码,英文版
    数值算法有原码,英文版-numerical algorithm code is the original English version
    2023-02-09 14:05:04下载
    积分:1
  • DG method for transport equations
    DG method for transport equations
    2022-01-27 08:40:38下载
    积分:1
  • 投影聚类的快速
    Fast Algorithms for Projected Clustering - PROCLUS - a traditional subspace clustering algorithm for high dimensional data-Fast Algorithms for Projected Clustering- PROCLUS- a traditional subspace clustering algorithm for high dimensional data
    2023-08-24 08:00:04下载
    积分:1
  • 基于C实现的采样复制的纹理图像修复方_可去除遮罩物
    资源描述CS7495 Final Project  Sooraj Bhat Object Removal by Exemplar-based Inpainting USING THE CODE Everything was done in Matlab and MEX (i.e. a C function callable from Matlab).  First, the C code needs to be compiled.  At the Matlab prompt, type:    mex bestexemplarhelper.c You should then be able to run the following (which takes ~2mins on my 2GHz Pentium 4 laptop with 256MB of RAM):    [i1,i2,i3,c,d,mov] = inpaint("bungee0.png","bungee1.png",[0 255 0]); A smaller run (~25 seconds) would be:    [i1,i2,i3,c,d,mov] = inpaint("bw0.png","bw2.png",[0 255 0]); To visualize:    plotall;    close; movie(mov); SAMPLE IMAGES & RESULTS *0.png      The original images ("bw" and "bungee") *{1,2}.png    The different fill region masks. *P2.png     &nbs
    2022-02-01 13:35:37下载
    积分:1
  • A program to demonstrate the optimization process of ant colony optimization for...
    A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
    2022-02-19 22:51:42下载
    积分:1
  • 杜鹃时间
    它是杜鹃搜索算法的MATLAB语言编码。杜鹃是求解NP难问题的优化算法类型
    2022-03-23 17:43:31下载
    积分:1
  • 这是个NPC问题求解,PassBridge code
    这是个NPC问题求解,PassBridge code-NPC This is a problem solving, PassBridge code
    2022-03-18 03:53:50下载
    积分:1
  • 一维积分的连分式的c语言实现
    计算一维积分的连分式法的c语言实现-calculated an integral dimension of the law even fractional c Language
    2022-03-21 17:35:27下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载