-
08576798works
说明： 用于去除背景，得到原图与背景相减的图像并二值化(boundaries defects and improve the quality of remote sensing images and improve the visual effects))
- 2019-12-31 20:31:15下载
- 积分：1
-
huisemoxingyuce
灰色预测模型matlab,灰色模型GM(1,1)程序二次拟合和等维新陈代谢改进预测程(Matlab of gray prediction model, gray model GM (1,1) procedures for the second fitting and the same dimension metabolism to improve the forecasting process
)
- 2012-04-15 10:41:18下载
- 积分：1
-
Track_4
MAD相似性度量准则的改进，实现模板匹配程序(MAD similarity measurement criteria to improve and achieve template matching procedures)
- 2007-07-10 22:49:13下载
- 积分：1
-
ellipsefitting
输入一组数据，xy值，用来拟合椭圆。只要改变输入数据，该代码就可以直接使用。另附上椭圆拟合算法。(Enter a set of data, xy values, used to fit ellipses. Just change input data, the code can be used directly. Attached on the ellipse fitting algorithm.)
- 2010-11-15 14:56:43下载
- 积分：1
-
OIF
oif波段选择算法，可以用于对高光谱图像进行波段选择(oif band selection code of matlab)
- 2018-03-19 22:32:55下载
- 积分：1
-
眼睛鼻子嘴识别
说明： 图像处理-人脸识别技术：识别出图像中人物的五官形态，从而达到识别人脸的目的。(Image Processing-Face Recognition Technology)
- 2020-06-23 11:00:02下载
- 积分：1
-
selfdevelopment
利用自适应算法matlab程序来处理图像，弥补了直方图均衡化的缺点(Adaptive algorithm matlab program to process images, to make up for the shortcomings of the histogram equalization)
- 2012-05-21 12:28:21下载
- 积分：1
-
testfill
矢量区域填充算法（包括汉字提取生成） 算法(Vector area filling algorithm (including the extraction of Chinese characters generated) algorithm)
- 2007-08-09 11:44:31下载
- 积分：1
-
WinCC-V7.3-C脚本手册 (2)
wincc脚本数据手册，最全的C脚本，介绍详细，官方资料(wincc cript data manual, the most complete C script)
- 2021-03-18 10:19:20下载
- 积分：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
