-
wavelet-image-fusion
小波方法的多焦点图像融合,用的融合规则为Yong Yang:A Novel DWT Based Multi-focus Image Fusion Method的方法(Wavelet method for multi-focus image fusion, the fusion rules: A Novel DWT Based Multi-focus Image Fusion Method method Yong Yang,)
- 2012-12-08 22:20:40下载
- 积分:1
-
TMyPolyStockh
实现凸多边形排样,使用临界多边形NFP判断两个凸多边形形是否相交,使用启发式算法提高效率,
(Convex polygon nesting, polygon NFP to determine whether two convex polygon-shaped intersection, the use of heuristic algorithms to improve efficiency,)
- 2021-03-30 22:59:09下载
- 积分:1
-
CVA
主要是多光谱多波段两幅图像的变化检测求得差异影像 大家可以参考参考 运行主程序(mian is used to difference of two images)
- 2015-01-14 17:35:10下载
- 积分:1
-
1
说明: 求图像峰值信噪比PSNR代码,相信对你很有用(PSNR PSNR for the image code, I believe that is useful to you)
- 2008-04-01 11:03:34下载
- 积分:1
-
Fourier
实现了读取一个bmp图片的傅里叶变换 使用C语言实现 读取一个 24位 图 转换为8位灰度图后,进行傅里叶变换处理(二维) 采用快速傅里叶变换——蝶形算法 北航图像处理作业~需要进一步交流 请联系qq 422563357(Reads a bmp image to achieve a Fourier transform using C language Northern image processing operations)
- 2020-10-27 21:20:03下载
- 积分:1
-
minimum-watershed
实现粘连分割,对有粘连的物体分割效果很好,使用了局部极值结合分水岭算法(Achieve adhesion segmentation, to have adhesion object segmentation effect is very good, the use of the local extremum combined with watershed algorithm
)
- 2012-08-26 16:22:23下载
- 积分:1
-
the-second-generation-curvelet-for-multifocus-imag
第二代曲波多聚焦图像融合的MATLAB源代码(the second generation curvelet for multifocus image fusion)
- 2009-10-16 10:25:39下载
- 积分:1
-
AN11232
USB Composit example for HID
- 2017-09-06 21:50:52下载
- 积分:1
-
SAD
C++实现的SAD立体匹配算法,速度快,效果不错(SAD stereo matching method,it runs well.)
- 2021-01-19 16:38:42下载
- 积分: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