登录
首页 » WINDOWS » mingw

mingw

于 2018-02-21 发布 文件大小:6KB
0 80
下载积分: 1 下载次数: 2

代码说明:

  very useful toolbox for the matlab user

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • cviu_eye
    the blink eyes tracking
    2012-06-02 17:21:24下载
    积分:1
  • 分割
    纹理图像分割的算法和实例,其中包括理论的讲解和 MATLAB 文件。(Algorithms and Examples of Texture Image Segmentation)
    2018-12-03 20:55:42下载
    积分:1
  • periodic-3d-tongzhou-resonanter
    ---三维fdtd程序,采用周期性边界条件(3D fdtd procedures, periodic boundary conditions)
    2021-04-13 15:58:57下载
    积分:1
  • Zernike_code
    经典亚像素边缘检测算法Zernike算法程序,编译过可以运行!!(Classical active contour the snake model program, you can run the compiled! !)
    2013-01-04 14:34:05下载
    积分:1
  • POCS
    关于超分辨率图像恢复的凸集投影算法,运行结果正确。(code about super-resolution based on POCS)
    2021-03-19 19:29:18下载
    积分:1
  • RANSAC+SURF
    说明:  基于SURF算法实现图像特征提取与描述,使用RANSAC进行图像细配准(SURF algorithm was used to extract and describe image features, and RANSAC was used for image registration)
    2021-03-03 15:09:33下载
    积分:1
  • Contourlet
    实现图像的Contourlet变换,显示图像变换后每一层的图像。(Realize the Contourlet transform of the image , each layer of image is displayed after transform.)
    2015-10-29 09:18:52下载
    积分:1
  • Block-matching(Matlab)
    用块匹配法求超分辨率复原中的运动矩阵!提出了一种快速,半像素的三步法!(Block-matching method using super-resolution recovery of movement in the matrix! Presents a fast, three-step half-pixel!)
    2009-06-14 22:18:20下载
    积分: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
  • 数字
    数字图像处理,DFT,IDFT,DCT,IDCT,求频谱(Digital image processing, DFT, IDFT, DCT, IDCT, spectrum)
    2018-09-24 19:48:46下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 42今日下载