SSIM_Matlab_

医学超声图像滤波必看：针对斑点噪声的几种滤波算法的经典论文。包括Lee的滤波算法，Frost的滤波算法，Kuan的滤波算法，MAP（Maxima a priority）的滤波算法。(Medical ultrasound image filtering must-see: a classic paper several filtering algorithm for speckle noise. Including the filtering algorithm of Lee and Frost filtering algorithm, Kuan filter algorithm, MAP (Maxima a priority) filtering algorithm.)

说明：  带一个视频。路径要选择好才能运行，选择解压的此文件的路径。对运动视频的检测 返回一对坐标和大小，可识别运动物体。(The detection of moving video returns a pair of coordinates and sizes, which can identify moving objects.)

说明：  分子图像处理的软件，但没有数据库，具体操作看操作说明(Molecular image processing software, but there is no database, see the specific operation instructions)

Images of diffraction

将图像转换到HSV空间，并对其进行量化降维后，计算其颜色直方图(Image conversion to HSV space, and to quantify the dimensionality reduction, the calculation of its color histogram)

说明：  模式识别-贝叶斯最小错误率判别一幅图像是属于人，还是属于背景。图像经过预处理。(pattern recognition- Bayesian smallest error rate discriminant image is a person, or belong to the background. After pretreatment images.)

使用MATLAB进行高光谱数据显示（显示分类后图像）(Hyperspectral data display using MATLAB (displaying the classified image))

说明：  利用算数编码基本原理及其实现步骤，通过MATLAB实现算数编码。(Using the basic principle of arithmetic coding and its implementation steps, arithmetic coding is realized by MATLAB.)

本程序利用matlab语言，实现了对高光谱遥感图像的读取并做主成分分析，将结果按贡献率大小顺序排列并显示出来。(This procedure using matlab language to achieve a high spectral remote sensing image analysis components to read and call the shots, according to the results in order of contribution size and display.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)