登录
首页 » matlab » JA_extraction

JA_extraction

于 2021-02-21 发布 文件大小:17KB
0 75
下载积分: 1 下载次数: 43

代码说明:

  基于simulink的Jiles模型参数提取。使用中需使用simulink的parameter estimation功能(Jiles artheron model parameter extraction based on simulink)

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

发表评论

0 个回复

  • 1
    基于离散余弦变换的图像去噪,小波变换去噪(Wavelet denoising)
    2013-05-17 08:28:40下载
    积分:1
  • MATLAB
    主成分分析的MATLAB程序代码,mni坐标转Talairach坐标的MATLAB程序代码(Principal component analysis of MATLAB code, mni coordinates to Talairach coordinates of the MATLAB code)
    2008-04-16 12:13:36下载
    积分:1
  • 用Welch法进行功率谱估计
    考虑L的三个不同值:L=256(3个数据段),L=128(7个数据段)和L=64(15个数据段)。各自的谱估计图如上图所示。可以明显的看到,加窗明显的减小了频谱上的假谱峰,但也更加进一步平滑了谱峰。所以,对于L=64的情况,在ω=0.8π的谱线可以很确定的辨认,但是那两个靠近的谱峰不容易区分。对于L=128的情况,这种情况提供了在分离和检测间最好的均衡。当然,对于在L=256时的情况,效果是更好的,能够从谱估计图上明显的分辨出三条谱线的存在以及它们幅度关系的强弱。 除了Welch法外,还可以采用对多个周期图求平均的功率谱估计方法的其他方法如Bartlett法等等,在功率谱估计上也能取得较好的结果。(consider three different values : L = 256 (3 data), L = 128 (7 data) and L = 64 (15 data). Their spectral estimation map as shown in Fig. It is clear to see that increase significantly decreasing window of the spectrum of false peaks, but much more to further smooth the peaks. Therefore, L = 64, in the case = 0.8 spectrum can determine the identification, but that the two peaks around is not easy to distinguish. L = 128 for the situation, which provided the separation and detection among the best balanced. Of course, L = 256 in the case, the effect is better, from the spectral estimation map clearly distinguish between the three lines of the existence and their relationship to the rate of strength. In addition to Welch law, but also can be used to map multiple cycle for the average power)
    2005-07-12 11:18:13下载
    积分:1
  • cosamp
    THIS PDF IS AN INTRODUCTION TO ILLUSTRATE TH COSAMP ALGORITHM
    2014-11-28 01:15:29下载
    积分:1
  • hysthresh
    Edge detection result should be enhanced using linear method like Median filter to remove the garbage around the pupil to gain clear pupil to determine perfect centre. Get the centre of the pupil by counting the number of black pixels (zero value) of each column and row. Then get each row and column that has the maximum number of these black pixels. Then determine the center by simple calculation according to the image coordinate to set it correct on the image, consequently we can determine the radius of the pupil. Thus we can find the pupillary boundary (inner). A similar procedure is extended by using a coarse scale to locate the outer boundary (limbus) which can be apparent by using the mid-point algorithms of circle and ellipse.
    2011-11-18 02:01:43下载
    积分:1
  • ants
    改进蚁群路径规划,主方向因子,在二维空间搜索路径(mproved ant colony path planning)
    2017-04-05 23:37:00下载
    积分:1
  • NEH_F002
    改进的NEH 算法求解no-wait flowshop 问题,复杂度降低为n^2m(Improved NEH algorithm for no-wait flowshop problem, the complexity is reduced to n ^ 2m)
    2020-10-09 16:47:36下载
    积分:1
  • ada_Boost
    卡尔曼滤波算法程序 和集成学习算法程序。(Kalman filter algorithm program)
    2018-02-02 11:13:22下载
    积分:1
  • anchal
    program for edge detection in fuzzy image processing
    2010-12-09 16:03:03下载
    积分:1
  • permutationica
    考虑排序问题的盲卷积分离模型算法程序,实现盲源分离。(Consider the scheduling problem of blind separation model convolution algorithm program to achieve blind source separation.)
    2010-08-30 10:13:41下载
    积分:1
  • 696518资源总数
  • 104269会员总数
  • 42今日下载