登录
首页 » Visual C++ » threhold-dealt

threhold-dealt

于 2014-08-25 发布 文件大小:7949KB
0 262
下载积分: 1 下载次数: 1

代码说明:

  关于阈值处理的一部分参考文献,对于图像的二值化等很有帮助,是经过精心选择的参考文件。(References on the part of the processing threshold for image binarization helpful, is carefully selected reference files.)

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

发表评论

0 个回复

  • VCmeanshift
    自己毕业设计做的改进的基于某vc视频处理框架代码的重心多目标跟踪代码(The center of gravity of a vc video processing framework code-based target tracking code own graduation design improvements do)
    2013-01-23 09:50:30下载
    积分:1
  • 12
    说明:  关于图像处理里的一些应用,将视觉相应算法应用到工程实际中,详细解说了算法在这里面的一些应用,很实用。(On some applications in image processing, the visual corresponding algorithm is applied to the engineering practice, a detailed explanation here below in some applications, the proposed algorithm is very practical.)
    2015-01-10 14:48:06下载
    积分:1
  • Image-zooming
    实现bmp位图的图像放大缩小,包含整个mfc的源码文件。(Achieve bmp bitmap image zoom, contains the entire mfc source files.)
    2014-02-13 10:17:26下载
    积分:1
  • VCPP-image-processing-chapter06
    VisualC++数字图像处理技术详解第2版光盘-第六章(VisualC++ digital image processing technology Detailed Version 2 CD- Chapter VI)
    2016-04-16 13:34:28下载
    积分:1
  • sift
    sift匹配算法 尺度不变变换 特征描述子 特征点匹配 (sift match)
    2020-12-10 10:49:21下载
    积分:1
  • 02-gpbM
    M估计子,计算机视觉大牛Peter Meer出品。(Generalized Projection based M-estimator C++ code to find the robust estimate derived without using any user supplied scale. The theory is described in Generalized Projection Based M-stimator. )
    2020-12-22 16:59:06下载
    积分: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
  • tuxiangxihua
    图像处理基本算法其中之一的图像细化(Image processing one of the basic algorithm for image thinning)
    2008-06-04 17:11:50下载
    积分: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
  • Cpp1
    说明:  基于opencv的小面积区域的去除.可以去除面积小于指定面积的无兴趣区域.(Opencv-based small area of the region to remove. Can remove an area of less than the specified area is not interested in the region.)
    2008-12-04 11:17:17下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载