登录
首页 » PDF » book

book

于 2013-09-11 发布 文件大小:194KB
0 195
下载积分: 1 下载次数: 1

代码说明:

  数字图像处理常见问题及编程技巧汇编。希望对这方面的学习者有所帮助(Data, the software architect exam is a comprehensive commo)

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

发表评论

0 个回复

  • PCA
    PCA_进行indian_pines数据集合分类。((use PCA to classify the indian_pines data with train and test data in the rar))
    2020-12-11 13:19:18下载
    积分:1
  • Matching
    说明:  数字摄影测量中的最小二乘匹配算法,带示例图像(Feature points matching using LSTM)
    2019-04-22 13:42:21下载
    积分:1
  • imageronghe
    说明:  图像融合算法,exercise1:为基于小波变化与局部能量的图像融合方法 exercise2:为基于自适应算法的图像融合算法 myfunction1~myfunction5:为性能指标评价函数(Image fusion algorithm, exercise1: wavelet-based change and the local energy method of image fusion exercise2: adaptive algorithm based on image fusion algorithm myfunction1 ~ myfunction5: performance indicators for the evaluation function)
    2009-08-19 12:40:24下载
    积分:1
  • GetTexture
    用于分别从四个方向提取图形图像的纹理特征(For texture feature graphic images were extracted four directions)
    2015-12-12 10:08:08下载
    积分:1
  • adaptive
    介绍了当前谐波检测的主流的几种技术,包括瞬时无功功率理论,自适应检测理论,傅里叶变换理论等,并做了相应的建模分析(Introduced the mainstream of current harmonic detection of several techniques, including instantaneous reactive power theory, adaptive detection theory, Fourier transform theory, and do the corresponding modeling analysis)
    2016-02-17 10:14:38下载
    积分:1
  • orl_faces
    orl人脸库,40个人,每人10幅图像。(orl face database, 40 individuals, 10 images per person.)
    2009-06-12 18:46:06下载
    积分:1
  • SP_Liu_TCSVT_code2014
    说明:  用于显著性检测的对比算法SP的MATLAB版本,比较新的是2013年的,亲测可用(MatLAB version of SP, a contrast algorithm for saliency detection, is relatively new in 2013, and pro-test is available.)
    2020-06-16 19:00:02下载
    积分:1
  • winner-
    用matalab编译的winner滤波法对图像进行去噪处理,利用了FFT的方法(Compiled using matalab winner filtering method to deal with the noise of image, using the FFT method )
    2013-03-19 20:56:02下载
    积分:1
  • mrics
    使用split bregman算法实现的压缩感知(Compressed sensing implemented by using split Bregman algorithm)
    2017-10-29 21:12:39下载
    积分: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
  • 696516资源总数
  • 106914会员总数
  • 0今日下载