-
20100321image_fusion
说明： 利用区域能量方法的matlab图像处理程序直接可用(Use of regional energy method matlab image processing program can be used directly)
- 2010-03-21 09:52:02下载
- 积分：1
-
压缩感知中利用增广拉格朗日方程解最小稀疏正则化的恢复算法 DAL
压缩感知中利用增广拉格朗日方程解最小稀疏正则化的恢复算法(DAL solves the dual problem of (1) via the augmented Lagrangian method (see Bertsekas 82). It uses the analytic expression (and its derivatives) of the following soft-thresholding operation，
which can be computed for L1 and grouped L1 (and many other) sparsity inducing regularizers. If you are interested in our algorithm please find more details in our technical report or in my talk at Optimization for Machine Learning Workshop (NIPS 2009).)
- 2011-04-25 10:19:38下载
- 积分：1
-
LSD-OpenCV-MATLAB-master
LSD直线检测 基于LSD的直线提取算法(line segment detector)
- 2018-05-26 10:47:39下载
- 积分：1
-
NSCTTDPCACYCLEMODULE
非下采样轮廓波变换与二维主分量分析的循环模式计算(nonsubsambled contourlet transform and two dimensional principle component analysis cycle module calculation)
- 2012-01-17 20:20:47下载
- 积分：1
-
grandopen-close
利用idl语言实现图像的数学形态学开闭重建运算，比提取梯度图像。(Idl language use mathematical morphological opening and closing image reconstruction operations, compared to extract gradient image.)
- 2020-09-04 09:48:06下载
- 积分：1
-
3.2畸变校正技术
说明： 图像校正处理代码，能够运行，能够使用，并达到预期要求(Image correction processing code, able to run, use, and meet the expected requirements)
- 2020-04-30 11:12:55下载
- 积分：1
-
cyclostationary_toolbox
计算二维或多维循环自相关函数和自相关密度函数(Of two-dimensional or multidimensional cyclic autocorrelation function and autocorrelation function of the density)
- 2011-11-15 18:30:59下载
- 积分：1
-
jpegyasuo
jpeg压缩代码 An example for jpeg compression and the restoration。(The attached utility is a work I ve submitted to the university. It shows what a jpeg compression is all about.)
- 2013-11-19 11:35:58下载
- 积分：1
-
SFM
计算机视觉中，structure from motion的代码(computer vision, structure from motion code)
- 2007-05-24 16:22:05下载
- 积分：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
