搜索资源列表
RGLS.rar
- 广义最小二乘辨识（噪信比大的时候会收敛到局部极值，而非全局极值）,Generalized Least Squares Identification (noise than when the letter will converge to the local maximum, rather than the overall extremum)
MATLAB
- 实现局部寻找最大值点，通过Matlab软件实现-Local search for maximum points achieved by Matlab software
2dgaussian
- 汽车高斯曲面拟合 --- 2程序，以适应到表面二维高斯： 子= A *的进出口（ -（（西为X0）^2/2/sigmax^2 +（艺Y0的）^2/2/sigmay^ 2）。。）+ b的 这些例程是自动在某种意义上说，他们并不需要出发对模型参数的猜测规范。 autoGaussianSurfML（十一，彝，子）适合通过对模型参数的最大似然（最小二乘）。它首先计算了该模型在许多可能的参数值，然后选择最佳质量设置和细化与lsqcurvefit它。 auto
extremuma
- a fast and precise algoritm to find local maximum or minimum
recognitionvein
- This method will try to extract the centre lines of the veins. This is done by calculating local maximum curvatures in cross-sectional profiles of a vein image. The method is supposed to be robust against varying vein widths and non-uniform brightnes
lmax
- find the local maximum of the data, and filter high frequency signal.
fen_cha
- 求lorenz系统分岔图，求局部最大值函数-Seeking lorenz system bifurcation diagram, find a local maximum function
papr_windowing
- reduction to papr in ofdm with Peak Windowing: The basic idea of peak windowing is to multiply the envelope of OFDM signal with a weighting function . Therefore, ~xE (t)= xE (t) f (t) where XE(t) =[x(t)] The weighting function give
EMD
- EMD 算法的目的在于将性能不好的信号分解为一组性能较好的 IMFs 这里 IMF 须满足如下两个性质 1 信号的极值点 极大值或极小值 数目和过零点EMD 算法是 HHT 的核心算法之一 用来将信号分解为一组性能较好的固有模 态函数(IMF) 以便进行 Hilbert 变换 数目相等或最多相差一个 2 由局部极大值构成的上包络线和由局部极小值构成的下包络线的平均值为零 用于心电信号处理-The purpose of EMD algorithm is that the b
ppb
- This MATLAB software implements the denoising algorithm (the Probabilistic Patch-Based filter) for images damaged by multiplicative Nakagami-Rayleigh noise as presented in: Iterative Weighted Maximum Likelihood Denoising with Probabilistic Patc
bernsen
- The method uses a user-provided contrast threshold. If the local contrast (max-min) is above or equal to the contrast threshold, the threshold is set at the local midgrey value (the mean of the minimum and maximum grey values in the local window). If