image-fusion--atrous-wavelet--

《MATLAB神经网络30个案例分析》中的第21个例子，案例21 LVQ神经网络的分类——乳腺肿瘤诊断。希望对大家有一定的帮助！(The MATLAB neural network analysis of 30 cases of example, 21 cases of 21 LVQ neural network classification of breast cancer diagnosis. Hope to have certain help to everybody! )

加深对卡尔曼滤波算法的理解，了解卡尔曼滤波器算法的基本特点，掌握卡尔曼滤波算法应用研究的基本步骤和方法(deepen the Kalman filter algorithm understanding, knowledge Kalman Filter algorithm for the basic features, master Kalman filtering algorithm applied research on the basic steps and methods)

基于matlab GUI界面设计,LYYWKyo参数数学方法是部分子空间法，采用了小波去噪的思想，BP神经网络用于函数拟合与模式识别，PnTuuBt条件包含特征值与特征向量的提取、训练样本以及最后的识别，包括主成分分析、因子分析、贝叶斯分析。( Based on matlab GUI interface design, LYYWKyo parameter Mathematics is part of the subspace, Using wavelet denoising thought, BP neural network function fitting and pattern recognition, PnTuuBt condition Contains the eigenvalue and eigenvector extraction, the training sample, and the final recognition, Including principal component analysis, factor analysis, Bayesian analysis.)

介绍了配电网的设备利用率评价指标体系研究(With research equipment utilization evaluation system grid)

是两质量系统matlab中simulink模型(Two quality system matlab simulink model)

the MATLAB codes for the well-known modulation techniques.

混合动力汽车整车模型。创建了一个完整的整车模型，用于研究学习都可以。(Hybrid automobile model. Create a complete vehicle model can be used to study learning.)

CONSTANT MODULE ALGORITHM

matlab求交点，包括直线与直线的交点，直线与曲线的交点，曲线与曲线的交点(Matlab intersection point, including the intersection of straight line and line, intersection of straight line and curve, and the curve of intersection curve)

传统的K-medoids聚类算法的聚类结果随初始中心点的 不同而波动，且计算复杂度较高不适宜处理大规模数据集； 快速K-medoids聚类算法通过选择合适的初始聚类中心改进 了传统K-medoids聚类算法，但是快速K-medoids聚类算法 的初始聚类中心有可能位于同一类簇。为了克服传统的K- medoids聚类算法和快速K-medoids聚类算法的缺陷，提出 一种基于粒计算的K-medoids聚类算法。(The traditional K-medoids clustering algorithm clustering results with different initial center points and volatility, and high computational complexity is not suitable for processing large data sets; K-medoids clustering algorithm by choosing proper initial cluster centers to improve the traditional K-medoids clustering algorithm, but the initial cluster center of K-medoids clustering algorithm can be located in the same cluster. In order to overcome the shortcomings of the traditional K- medoids clustering algorithm and the fast K-medoids clustering algorithm, a K-medoids clustering algorithm based on granular computing is proposed.)