登录
首页 » Visual C++ » tuxiangpeizhun

tuxiangpeizhun

于 2010-05-30 发布 文件大小:3930KB
0 224
下载积分: 1 下载次数: 438

代码说明:

  使用VC++编程,自动检测角点,实现图像配准,代码可用。(Automatically detect the corner points, for image registration, the code is available.)

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

发表评论

0 个回复

  • gammacorrection
    说明:  对图像畸变进行校正,对有些图像由于近小远大照成的畸变进行校正,采用了opencv(To correct image distortion , It s important to the machine vision)
    2010-04-11 22:15:32下载
    积分:1
  • graphic
    里面涉及了线宽线型的设置,各种图形,还有画笔画刷设置选择,颜色设置等,代码非常齐全,还有编程的每一步都有截图和说明(Which involves the linewidth linear settings, a variety of graphics, and brush brush settings selection, color settings, the code is very complete, and programming of every step have screenshots and description)
    2014-12-14 20:30:20下载
    积分:1
  • 192168291092007531155683305865
    Image Watershed Segmentation图像边缘提取(Image Watershed Segmentation Image Edge Detection)
    2007-08-11 09:18:48下载
    积分:1
  • Codeblocks-MinGW-openCV
    use Codeblocks MinGW in openCV
    2012-04-16 09:41:20下载
    积分:1
  • Geometric-transformation
    几何变换,包括图形的基本变化,以及计算机图形学中的算法(Geometric transformations, including changes in the basic graphics, and computer graphics algorithms)
    2011-10-23 09:28:43下载
    积分:1
  • k_mean_uv
    利用k—mean算法根据U、V进行聚类分块,最后完成图像分割,分割出得块用不同的灰度等级表示出来。(K-mean algorithm to cluster sub-blocks according to the U, V, to finalize the image segmentation, segmentation have blocks with different gray levels represented.)
    2013-01-15 15:05:42下载
    积分:1
  • chp8
    第8章 图象的检测及模板匹配 图象的分割与检测(识别)实际上是一项非常困难的工作。很难说清楚为什么图象应该分割成这样而不是那样。(Chapter 8 Detection of image template matching and image segmentation and detection (recognition) is actually a very difficult task. It is hard to say clearly why the image should be divided into such and not as.)
    2008-04-12 19:32:03下载
    积分:1
  • surfAndsift
    里面有注释,还有sift和surf的比较(There are notes, there are more sift and surf the)
    2015-01-25 21:16:46下载
    积分: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
  • SPA
    连续投影算法的Matlab程序 下载后可以直接使用(Successive projections algorithm )
    2020-12-07 09:59:21下载
    积分:1
  • 696518资源总数
  • 106208会员总数
  • 21今日下载