-
ksvd-omp
实现稀疏表示算法,以lena图像为例,主要用ksvd和omp算法(The sparse representation algorithm is implemented. The Lena image is taken as an example, mainly using the ksvd and OMP algorithms.)
- 2020-06-28 20:00:01下载
- 积分:1
-
benhui_v86
未来线路预测,分析误差,粒子图像分割及匹配均为自行编制的子例程,能量谱分析计算。( Future line prediction, error analysis, Particle image segmentation and matching subroutines themselves are prepared, Energy spectrum analysis and calculation.)
- 2016-11-29 21:21:55下载
- 积分:1
-
C#百度OCR-本地和网络图片识别文字-更新
【实例简介】
- 2021-11-04 00:31:39下载
- 积分:1
-
svd
采用SVD方法进行人脸特征提取,希望对大家有用(SVD method using facial feature extraction, in the hope that useful to everybody)
- 2009-03-10 10:35:01下载
- 积分:1
-
chapter02
matlab6.5图形图像处理源程序 部分内容 第二章压缩包 (matlab6.5 )
- 2013-10-27 13:02:04下载
- 积分:1
-
CCA
最完整的CCA典型相关分析程序,分析两幅图像,相似度,匹配,融合都可以使用,分析天气变量也可以使用。(The most complete CCA canonical correlation analysis program, analysis of two images, similarity, matching, fusion can be used, analysis of weather variables can also be used.)
- 2017-09-28 08:40:47下载
- 积分:1
-
fitellipse
非常好的椭圆拟合算法,拟合进度很高,算法很好理解,代码质量高(Ellipse fitting algorithm is very good, very fit schedule, a good understanding of algorithms, high code quality)
- 2017-02-07 14:22:08下载
- 积分:1
-
swt_enhance_main
sar图像处理的滤噪小程序 用于图像的增强。(sar Denoising image processing applet for image enhancement.)
- 2008-03-11 16:20:03下载
- 积分:1
-
example
这是matlab视频图像处理中提取图像并将其转化为灰度图像的m文件,这是图像处理中的第一步(This is a matlab video image processing to extract images and translate them into gray image of m documents, this is the first step in image processing)
- 2008-05-13 17:30:10下载
- 积分: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