-
Totalvariation
一个自适应的滤波处理的方法,可以对图像有很好的处理效果。(An adaptive filtering method of treatment can have a good image the effect of treatment.)
- 2009-03-11 21:15:52下载
- 积分:1
-
ksvdsbox11-min
KSVD字典训练程序,用于生成适应于图像内容的稀疏字典。稀疏描述必读程序。(KSVD dictionary training program used to generate a sparse dictionary adapted to image content. Sparse description of the Privacy Policy program.)
- 2012-08-16 16:42:23下载
- 积分:1
-
Cal_entropy
说明: 基于matlab平台计算一副图像的信息熵(Calculate the entropy of an iamge using matlab)
- 2009-07-30 19:59:37下载
- 积分:1
-
fftchazhi
基于matlab平台的fft加窗插值算法,适用于信号分析(Wft window interpolation algorithm based on matlab platform, suitable for signal analysis)
- 2020-06-24 11:20:02下载
- 积分:1
-
Wpacketdaimaa
小波包去噪C + +源代码,包括信号小波包分解,,最优树的选择,并重建一个,可以直接使用。
(Wavelet packet denoising C++ source code, including the signal wavelet packet decomposition, the optimal choice of the tree, and rebuild a can be used directly.)
- 2012-07-25 06:26:23下载
- 积分:1
-
photo_cut
图形裁剪,实现对画的线,多边形,交点进行剪裁,实现图形的规范化(Graphic cutting, to achieve the painting line, polygon, tailoring intersection, graphics standardization)
- 2014-04-12 09:34:12下载
- 积分:1
-
Image-and-Video-Steganography-master
说明: 实现了图像与视频的信息隐藏,输入图片和视频可进行效果演示(The information hiding of image and video is realized)
- 2021-04-06 11:29:02下载
- 积分:1
-
Itxxhm
图像细化注意,本程序的细化算法要应用于于含线条的黑白二值图像才可以看出细化效果。
(The thinning Note refinement algorithm of this program is to be applied to black and white binary image containing lines can be seen that the refinement effect.)
- 2012-08-05 18:16:42下载
- 积分:1
-
meanshift
一个外国人写的很好的meanshift聚类算法,有例程,可运行(Written by a foreigner meanshift good clustering algorithm, a routine can be run)
- 2020-06-26 19:20:02下载
- 积分: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