利用K均值聚类的方法实现人体的检测，混合高斯模型建立背景并实时更新...

vb图像处理，windows环境-vb image processing, windows environment

OTSU算法是一个可以稳定获取图像分割阈值的好方法，本人根据其思想，编译了一个函数，可以方便您的调用，自适应的获取图像的阈值，-OTSU algorithm is a segmentation threshold can be stabilized to obtain the value of a good way, in accordance with their thoughts, to compile a function, you can easily call adaptive image acquisition threshold,

经典书籍-数字图像处理-冈萨雷斯--2。解决各位敲代码的烦恼！These MATLAB functions were created for the book Digital Image Processing Using MATLAB (DIPUM), by R.C. Gonzalez, R.E. Woods, and S.L. Eddins, Prentice Ha-Classic books- digital image processing- Gonzalez 2. To resolve the trouble code you knock! These MATLAB functions were created for the book Digital ImageProcessing Using MATLAB (DIPUM), by RC Gonzalez, RE Woods, andS.L. Eddins, Prentice Ha

这个也是图形学的一个作业，不过功能比较全面和强大，可以完成基本几何体的造型、多边形化，可以设置场景光源并进行光线跟踪渲染等。启动类为final_3d.Final_3D-this is a graphics operation, but function more comprehensive and powerful, can be completed basic geometric shapes, polygons, and can be installed Scene light source and Ray Tracing rendering, etc.. Start category final_3d.Final_3D

图形图像处理函数命令及详细列表，很详细地介绍了图形图像处理函数接口.-Graphic image processing function and a detailed list of commands, it is a detailed description of the graphic interface of image processing functions.

对于彩色图像的 k均值算法的matlab代码 文件置于c盘根目录-Colored graphics k-means algorithm matlab code

通过matlab对多幅图像进行图像分割，并找出关键区域，实现定位-Of multiple images through the matlab image segmentation, and identify critical areas to achieve positioning

图像边沿处理、检测与提取，是常用的图像处理软件之一-Edge image processing, detection and extraction, is commonly used in image processing software, one of

自己编写的分水岭算法。。很好用的方法。。这一直接使用-I have written a watershed algorithm. . Good methodology used. . The direct use of

摘要：拐点是数字图像中的一个重要信息载体 提出一种新的拐点检测算法 该算法并非寻找连续空间中曲率的离散近似计算方法，而是源于离散曲线的外观特征，推导出离散曲线上拐点处k个点对间欧氏距离平方和局部最小这一重要性质。基于该性质，本算法首先利用Freeman链码的性质.过滤掉物体边界上明显不可能成为拐点的象素，然后在剩余的边界点中通过寻找该局部最小值定位出拐点。给出了本算法与四种著名拐点检测算法的对比实验。 -Abstract: The inflection point is a digital image of an important information carrier put forward a new turning point detection algorithm the algorithm does not look for continuous space discrete approximation of the curvature calculation method, but from the appearance of characteristics of discrete curve derived discrete curve the inflection point at k-points between the squared Euclidean distance and the local minimum of this important property. Based on the nature of the algorithm is the first to use Freeman chain code in nature. Filter out objects clearly can not become a turning point on the border pixel, and then in the remaining boundary points by finding out the turning point of the local minimum position. The algorithm is given inflection point detection algorithm with th