-
TVMMcode
说明: 国外一个博士写的图像复原的源码 ,基于自适应的正则化的全变分图像复原,源码内有作者的主页,相应文章可以下载。代码测试,可用,效果不错 ,做这方面的同志可以下来看看 (Dr. written by a foreign source image restoration based on adaptive regularization total variation image restoration, source inside of the home page, the corresponding articles can be downloaded. Code test, available, good results, so this could be down to see Comrade)
- 2010-05-04 13:35:52下载
- 积分:1
-
eigen_decomposition
极化SAR图像处理中的目标特征矩阵分解程序(Polarization SAR image processing target characteristic matrix decomposition process)
- 2008-12-13 11:15:22下载
- 积分:1
-
MATLAB
小波去噪,图像融合,简单的小波去噪程序.(Image denoising in the wavelet domain using Matlab.)
- 2012-05-15 19:17:29下载
- 积分:1
-
wavelet
对图像进行小波分解,可以调整层数,效率较高,精确度较高(The image wavelet decomposition, you can adjust the number of layers, higher efficiency, higher precision)
- 2013-05-16 10:54:53下载
- 积分:1
-
ROA-CANNY
ROA和CANNY结合的算子,图像效果还行吧(it combine the CANNY and the ROA,the result shows it was perfect)
- 2020-10-15 11:17:29下载
- 积分:1
-
1231
火灾探测中火焰图像分割方法研究,比较实用。(Fire detection fire image segmentation, more practical.)
- 2010-12-07 13:34:27下载
- 积分:1
-
SVM
一些使用支持矢量机进行图像分割的算法,以及相关的文献资料,打包下载的好东西哦(Some use support vector machine algorithm for image segmentation, and related literature, package download a good thing)
- 2012-06-18 17:54:47下载
- 积分:1
-
array2
能够提取一幅图片的不变矩特征值,方便大家学习图像识别方面的开发技术(Able to extract a picture of the moment invariant features of value, to facilitate learning in the development of image recognition technology)
- 2011-07-16 11:03:02下载
- 积分:1
-
C#使用WebService调用海康SDK实现抓图与录像实时下载
一个C#使用WebService调用海康SDK实现抓图与录像实时下载的小例子
- 2020-03-31下载
- 积分:1
-
BFSPDFS
广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始,搜索与其线连接的所有节点,按照广度方向像外扩展,直到不重复遍历所有节点;深度优先搜索是从某一节点开始,沿着其搜索到的第一个节点不断深入下去,当无法再深入的时候,回溯节点,然后再在回溯中的某一节点开始沿另一个方向深度搜索,直到不重复的遍历所有节点。
(Breadth-first search and depth-first search in the network topology is realized. Breadth-first search is started from a node, searching all the nodes connected to its line, in accordance with the breadth direction as extracapsular extension, until no repeat traverse all nodes depth-first search is started from a node along its search to the first nodes deepening it, when it can not go any further, backtracking node, and then back again in the beginning of a node depth search in the other direction until the non-repetition of the traverse all nodes.)
- 2013-08-10 10:37:12下载
- 积分:1