CepstrumPWiner

K均值 很好用的K均值代码 很好用的K均值代码(K-means K-means used in a very good code)

一个集成的图形界面的程序，可调用每一次作业子程序。 一、调用画点的函数，用DDA、中点算法画直线和中点算法画圆和椭圆。 二、多边形扫描转换算法和区域填充算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法为任选；基于种子的区域填充采用4连通区域的递归种子填充算法，或扫描线种子填充算法，要求种子点(x,y)可交互输入）。 三、线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。 四、用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括类似自行车行走和绕固定点旋转的自旋转物体动画。） 五、简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。 六、交互式Bezier曲线的输入绘制程序实现 (An integrated graphical interface of the program, each operation subroutine callable. One call a function of the point of the painting, with the DDA, the midpoint algorithm for drawing a straight line and the midpoint algorithm circle and oval. Second, the polygon scan conversion algorithm and region filling algorithm (scan line algorithm for must fill and edge flag algorithm based on the edge of the modulo operator is optional using the 4 regional connectivity recursive seed filling algorithm based on the area of seed filling, or scan line seed filling algorithm requires the seed point (x, y) can be entered interactively). Line Clipping polygon clipping algorithm animation achieved. (Two Line Clipping Algorithm and HS polygon-by-side clipping algorithm) polygon clipping algorithm animation requires draw a closed polygon, rectangle and then draw the crop window, and then select the the cropped button (or command), press the "on top of cutting "button (or the implementation of)

提取图像的局部二值特征；广泛用于纹理特征提取 具有旋转不变性(Extract local two value features of images; widely used in texture feature extraction. Rotation invariance)

说明：  使用Splitting算法和GLA算法实现对图像的矢量量化及重新编码和重建。(Vector Quantization:To generate a 16-codeword codebook using Splitting Algorithm and GLA,then use this codebook to code the training image and reconstuct it.)

说明：  可用于图像分割、识别分类、语音识别等的代码实现(Recognition classification)

指纹图像处理包括梯度处理、方向场处理、平滑处理、智能增强处理等(The fingerprint image processing including gradient processing, direction field processing, smooth processing and intelligent enhancement processing, etc)

广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点；深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。 (Breadth-first search and depth-first search in the network topology is realized. Breadth-first search is started from a node, searching all the nodes connected to its line, in accordance with the breadth direction as extracapsular extension, until no repeat traverse all nodes depth-first search is started from a node along its search to the first nodes deepening it, when it can not go any further, backtracking node, and then back again in the beginning of a node depth search in the other direction until the non-repetition of the traverse all nodes.)

Matlab time-frequency analysis supporting the source code of chapter 12, please share

ostu图像分割阈值算法,对Ostu图像分割最优阈值进行优化处理，极大缩短了搜索图像阈值计算时间，与传统的枚举法Otsu方法相比,在计算时间上具有显著的优点。(ostu threshold image segmentation algorithm for image segmentation Ostu optimal thresholds to optimize the processing, greatly reduces the search image thresholding computation time, with the traditional enumeration method Otsu methods, in the calculation of time has significant advantages.)

说明：  进行三维去高后，根据sar参数信息，将斜距转变为地距。(After performing three-dimensional height removal, the slope distance is converted to ground distance according to the sar parameter information.)