k-means-for-image-segmentation

对于叶片面积的计算，进行图像预处理，灰度转换、直方图、去噪声等，最终计算出叶片面积的像素和。(For the calculation of leaf area, image pre-processing, gray-scale conversion, histogram, to noise, etc., and ultimately calculate the leaf area and the pixels.)

一种光学测试的算法，有助于全面分析激光大气传输特性及其对光电系统性能的影响，希望对大家有帮助哦(An optical testing algorithm, which helps to fully analyze the characteristics of laser propagation in the atmosphere and its impact on the performance of photovoltaic systems, we want to help oh)

偏微分方程_PDEs_模型在图像处理中的若干应用(_PDEs_ Model partial differential equations in image processing)

球面投影,用于图像空间数据到目标坐标系下的映射(sphere project)

该源码可以实现对彩色或灰度图像的曲波（Curvelet）特征的提取，以便后续做纹理图像分割。(The source can be achieved in color or grayscale images Qu Bo (Curvelet) feature extraction in order to do follow-up texture image segmentation.)

基于meanshift/camshift的视频运动目标跟踪实现，通过鼠标手动选择跟踪目标。基于HSV空间模型，可手动调节H S V的阈值，显示前景、背景、反响投影图。开发工具是VS2008、OPENCV.(Based meanshift/camshift video moving target tracking achieved manually using the mouse to select the target track. HSV space model, you can manually adjust the threshold HSV, showing foreground, background, reaction projection. Development tools are VS2008, OPENCV)

说明：  思想：把原始图的直方图变换为均匀分布的形式，这样就增加了灰度值的动态 范围从而达到增强图像整体对比度的效果。其优点是能自动地增强整个 图像的对比度。 1、对灰度图像进行直方图的均衡化处理，达到图像增强的目的。 2、利用平均滤波和中值滤波对图像进行平滑滤波。 3、利用拉普拉斯运算对图像进行锐化滤波。(Idea: transform the histogram of the original image into the form of uniform distribution, so as to increase the dynamic gray value Range to enhance the overall contrast of the image. Its advantage is that it can automatically enhance the contrast of the whole image. 1. The gray image is processed by histogram equalization to achieve the purpose of image enhancement. 2. Average filter and median filter are used to smooth the image. 3. Using Laplace operation to sharpen the image.)

马尔可夫（MRF）图像分割MATLAB源码,有30几个函数。Markov随机场的例子程序,对于初学MRF的人很有用,能得到直观的印象(Markov (MRF) image segmentation MATLAB source code, 30 a number of functions. Markov random field example of the procedure, for beginner person MRF useful that they can get a visual impression)

按照最邻近原则把待分类样本点分到各个簇。然后按平均法重新计算各个簇的质心，从而确定新的簇心。一直迭代，直到簇心的移动距离小于某个给定的值。(According to the nearest neighbor principle, the sample points to be classified are divided into clusters. Then the centroid of each cluster is recalculated according to the average method to determine the new cluster center. Iterate until the moving distance of the cluster center is less than a given value)

对于二值图像进行labeling,求的对象个数，每个对象的像素数，中心点，长宽高矮值等(labeling for bianry image)