登录
首页 » matlab » Inagehistogram

Inagehistogram

于 2009-07-01 发布 文件大小:3KB
0 215
下载积分: 1 下载次数: 42

代码说明:

  图像直方图均衡化的程序设计库函数验证MATLAB(Image histogram equalization procedure to verify the design of library functions)

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

发表评论

0 个回复

  • K2
    说明:  用matlab实现的K2算法,需要用到贝叶斯网络工具箱(K2 algorithm implemented with matlab)
    2011-03-07 15:55:46下载
    积分:1
  • EITHT
    mATLAB教程第六章案例,时间变动序列(mATLAB Tutorial Chapter VI case, the time sequence changes)
    2013-07-20 10:01:58下载
    积分:1
  • RS_BCH
    RS码和BCH码译码的MATLAB源文件,可以作为C代码的参考(RS code and BCH Decoding the MATLAB source file can be used as the reference C code)
    2007-08-19 10:08:08下载
    积分:1
  • matlabpratical
    matlab program for very useful to practical
    2010-08-31 13:13:46下载
    积分:1
  • abs-mimo-ofdm
    MIMO OFDM BASE MATLAB ABSTACTS FOR MULTI USER COMMUNICATION SYSTEM
    2014-09-23 15:10:26下载
    积分:1
  • lq
    说明:  利用MATLAB强大的图形处理功能,符号运算功能和数值计算功能,实现连续时间非周期信号频域分析的仿真波形; 1、用MATLAB实现典型非周期信号的频域分析; 2、用MATLAB实现信号的幅度调制; 3、用MATLAB实现信号傅立叶变换性质的仿真波形; (The use of MATLAB powerful graphics processing capabilities, symbolic computing and numerical computing capabilities to achieve continuous-time non-periodic signal frequency domain analysis of the simulation waveform 1, using MATLAB to achieve a typical non-periodic signal frequency domain analysis 2, using MATLAB to achieve signal amplitude modulation 3, using MATLAB for signal Fourier transform nature of the simulation waveform )
    2010-03-16 20:16:39下载
    积分:1
  • sanwj
    说明:  三次样条插值,三弯矩法计算,曲线拟合,求插值点的函数值,一阶导数,二阶导数(Cubic spline interpolation, three-moment method, curve fitting, interpolation points demand function values, first-order derivative, second derivative)
    2010-03-18 10:03:41下载
    积分:1
  • ch3
    数学建模,用于小程序的建模,十分有用,毕业设计用的( ground wave radar simulation MATLAB program gives the graphical interface)
    2013-02-20 06:15:51下载
    积分:1
  • kalmanfilter
    Matlab code for Kalman filter
    2013-09-27 02:23:14下载
    积分:1
  • Centrality-measures
    文件包括:1.计算平均最短路径;2.计算每个顶点相邻节点的平均度;3.计算每个节点的邻近中心度;4.计算节点的介数(slow);5.计算节点的介数(faster);6.计算每条边的介数值;7.快速迪杰斯特拉算法;8.经典迪杰斯特拉算法。(1.the average shortest path in the graph 2.the average degree of neighboring nodes for every vertex 3.computes the closeness centrality for all vertices 4.node betweenness, (number of shortest paths definition) 5.a faster node betweenness algorithm 6.edge betweenness, (number of shortest paths definition) 7.simple Dijkstra, does not remember the path 8.Dijkstra which also returns the shortest paths.)
    2021-04-23 19:38:47下载
    积分:1
  • 696516资源总数
  • 106611会员总数
  • 19今日下载