登录
首页 » matlab » Texture-analysis

Texture-analysis

于 2014-09-19 发布 文件大小:2KB
0 226
下载积分: 1 下载次数: 4

代码说明:

  Texture Segmentation Using Texture Filters such as : entropyfilt, rangefilt and stdfilt.

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

发表评论

0 个回复

  • AnExampleOfKalmanFiltering
    Summary: An example of KALMAN FILTER MATLAB Release: R13SP1 Required Products: Communications Toolbox,Signal Processing Toolbox Description: THIS PROGRAM DEMONSTRATES AN EXAMPLE OF KALMAN FILTER.
    2007-11-27 00:47:06下载
    积分:1
  • code
    Matlab based Static Simulator, from Laiho s book for UMTS
    2009-06-02 22:40:30下载
    积分:1
  • gsi16
    徕卡1200数据传输很好用的格式文件,供大家参考使用 (Excellent Leica 1200 data transmission format used for your reference to use)
    2010-03-12 11:45:04下载
    积分:1
  • N_R
    电力系统潮流算法,极坐标算法和直角坐标算法(Power flow algorithm, polar coordinates algorithm and Cartesian coordinates algorithm)
    2012-10-28 20:11:12下载
    积分:1
  • CMAPSSData
    说明:  matlab code for prognostics-metrics
    2021-04-28 21:58:43下载
    积分:1
  • ecg_filter
    It is the code to demonstrate actof filtering
    2009-05-19 20:37:50下载
    积分:1
  • PWE_PBS_3Dfcc
    Calculates photonic band structure for either an fcc or diamond lattice of dielectric spheres of dielectric constant epsilon_a in a dielectric background of dielectric constant epsilon_b.(Calculates photonic band structure for ei ther'isnt an fcc or diamond lattice of dielectric v. eres of dielectric constant in a diel epsilon_a ectric background of dielectric constant epsi lon_b.)
    2007-05-06 16:26:46下载
    积分:1
  • soft_viterbi_final.m
    Soft Viterbi decoding algorithm for reed solomon.
    2014-02-20 00:48:55下载
    积分:1
  • 联合熵
    本程序适用于matlab中,读取两幅图像,求取两幅图像的联合熵 程序非常易懂,适合初学者使用,可以用里面的图片进行测试,注意对程序读取图片名进行更改。(Read the two images and calculate the joint entropy of the two images.)
    2020-12-15 14:59:13下载
    积分:1
  • simAnealing
    Simulated annealing (SA) is a generic probabilistic metaheuristic for the global optimization problem of applied mathematics, namely locating a good approximation to the global optimum of a given function in a large search space. It is often used when the search space is discrete (e.g., all tours that visit a given set of cities). For certain problems, simulated annealing may be more effective than exhaustive enumeration — provided that the goal is merely to find an acceptably good solution in a fixed amount of time, rather than the best possible solution.
    2010-07-07 12:57:40下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载