-
PDE_Programs
图像处理的偏微分方程方法,包括曲线演化,图像分割,图像滤波,图像复原等的matlab源代码。(Partial differential equations of image processing methods, including curve evolution, image segmentation, image filtering, image restoration, etc. matlab source code.)
- 2011-08-10 15:56:03下载
- 积分:1
-
laguerre
生成拉盖尔函数、缔合拉盖尔函数,并根据这两个函数的解析表达式画出若干个拉盖尔-高斯光束模型(Generation of Laguerre functions, associative Laguerre functions, and according to the analytical expression of these two functions to draw a number of Laguerre- Gaussian beam model)
- 2020-09-28 17:57:46下载
- 积分:1
-
wu-manber
wu-manber算法纯c实现,多模匹配算法,效率比较高,喜欢的可以下载看看,已经调试,没有问题(wu-manber algorithm)
- 2012-08-29 16:48:50下载
- 积分:1
-
SAR_edge_detection_matlab
说明: 一种比较实用的sar影像边缘检测算法,谢谢大家交流(A practical edge detection algorithm for SAR images. Thank you for your communication.)
- 2019-03-22 20:25:02下载
- 积分:1
-
ica
高光谱遥感图像光谱解混的独立成分分析技术(Hyperspectral remote sensing image spectra unmixing independent component analysis)
- 2013-09-28 10:37:30下载
- 积分:1
-
evalute
图像融合的各种Q值评价指标的代码,包括Q0,Qe,Qw,Qabf,vif等,非常适合图像融合的质量评价(Q values of various uation code image fusion, including Q0, Qe, Qw, Qabf, vif, etc., is very suitable for quality uation of image fusion)
- 2021-04-21 22:28:49下载
- 积分:1
-
chapter-5
Wily book Digital Image processing fundamental dip
- 2013-08-18 13:50:17下载
- 积分:1
-
workspace
自己做的3-PSS并联机器人可达工作空间绘制的MATLAB程序,
workspace_main.m为主程序,在MATLAB中进入解压缩后的文件夹并运行workspace_main即可完成绘图。
另外Trirspace.m为3-RRR平面并联机器人可达工作空间的绘图程序,调用方法相同。(The 3-PSS parallel robot designed by myself can reach the MATLAB program drawn in workspace.
The workspace_main.m is the main program. The drawing can be completed by entering the decompressed folder in MATLAB and running workspace_main.
In addition, the drawing program of 3-RRR planar parallel robot reachable workspace is called by the same method.)
- 2018-11-12 16:12:32下载
- 积分:1
-
precondition
该仿真程序实现可见光图像和红外图像的融合,(The visible light image and infrared image fusion
)
- 2013-05-22 19:03:31下载
- 积分:1
-
minimum-spanning-tree
在一个具有几个顶点的连通图G中,如果存在子图G 包含G中所有顶点和一部分边,且不形成回路,则称G 为图G的生成树,代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)
- 2013-08-23 23:06:57下载
- 积分:1