shuixia

基于Mean Shift的图像分割过程就是首先利用Mean Shift算法对图像中的像素进行聚类，即把收敛到同一点的起始点归为一类，然后把这一类的标号赋给这些起始点，同时把包含像素点太少的类去掉。然后，采用阈值化分割的方法对图像进行二值化处理 (Mean Shift Based on the process of image segmentation is the first to use the image Mean Shift algorithm for clustering of pixels, that is, to converge to the same point as a starting point to the category and then assigned to this type of labeling of these starting points, at the same time to contain too few pixels to remove the category. Then, using thresholding segmentation method of binary image processing)

图像处理源程序，实现二值化变换，经一幅图像灰度化后，变成二值化图像，包括大津法、最大类间方差法、一般阈值法、及文本识别最有用的Niblack法(Image processing program and realized binarization transformation, after by a gray-scale image into binary image, including the Otsu method, Otsu method, the general threshold, and text to identify the most useful Niblack method)

说明：  对指定的一幅含有多个目标的灰度图像，进行基于阈值的图像分割处理，对结果图像进行基于数学形态学的后处理设计，以得到更理想的目标区域。最后对结果图像进行区域标记（以颜色区分不同区域）并提取目标个数、各目标区域的面积、圆形度等特征。(The gray image with multiple targets is segmented based on threshold, and the result image is designed based on mathematical morphology to get a better target area. Finally, we mark the region of the result image (distinguish different regions by color) and extract the number of targets, the area of each target region, roundness and other features.)

设计GUI界面，方便用户录制原始语音信号，加入噪声并选择滤波器滤除噪声。(Designed GUI interface, user-friendly recording of the original speech signal, adding noise and select a filter to filter out noise.)

基于物体灰度图像的物体三维形状恢复，修改图形路径和光源方向即可(Based on the three-dimensional shape of the object to restore the object grayscale image, modify the graphics path and direction of the light source can be)

2维的基于互信息的图像配准算法，使用powell法作为优化算法(2-dimensional mutual information based image registration algorithms, the use of law as the optimization algorithm powell)

图像直方图统计，并生成灰度图。 matlab程序(Histogram of the image statistics, and generate grayscale. Matlab program)

广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始，搜索与其线连接的所有节点，按照广度方向像外扩展，直到不重复遍历所有节点；深度优先搜索是从某一节点开始，沿着其搜索到的第一个节点不断深入下去，当无法再深入的时候，回溯节点，然后再在回溯中的某一节点开始沿另一个方向深度搜索，直到不重复的遍历所有节点。 (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.)

说明：  tiff图像的读取与处理，并且说明清新，有很大的帮助。(The reading and processing of the tiff image, and the description of the fresh, is of great help.)

这是一个经典的fourier translate 傅里叶变换的程序 计算图像的中心点并标记和傅里叶频谱图的最大能量环并标记(This is a classic Fourier transform fourier translate the program to calculate the center of the image and mark and Fourier frequency spectrum of the maximum energy ring and mark)