伪Zernike矩特征提取，Zernike矩特征提取，供参考，很有用

利用聚类算法分割图像，将维对分法只可将图像分为2部分，可以作为二值化的代码,K-均值法可将图像分为任意多部分。程序直接采用R、G、B三色作为特征参数，聚类中心为随机值，当然也可以采用其他参数，程序编译为EXE文件后速度还可以接受，但尚有改进的余地，那位高手有空修改的话，请给我也发份代码。-clustering algorithm using image segmentation, Victoria right method can only image is divided into two parts, the two values can be used as the source, K-means algorithm can be divided into images of arbitrary multi-part. Procedures used directly in R, G, B color as the characteristic parameters for the cluster center random value, of course, can also be used for other parameters, procedures EXE compiler to speed document acceptable, but there is still room for improvement, but the master of the time change, then please give me also made in the code.

一个基于C++的图像处理算法，包括帧差分法、背景法和meanshift跟踪。-One based on C++, image processing algorithms, including the frame difference method, the background law and meanshift track.

vtk+itk+.net的域值滤波方法，.net 2005可以直接运行！-vtk+ itk+. net domain filtering methods,. net 2005 can be directly run!

改变屏幕分辨率,非常好用,请大家共享,共同提高-change the screen resolution, very handy, please share, enhance

C++ Builder高级界面特效制作百例-100 example of the make c++ bulider senior interface specially good effect

多边形生成器：输入边数，该程序能生成对应的多边形-polygon generator : Admission edge, the program can generate the corresponding polygonal

P0301：数字图像矩阵数据的显示及其傅立叶变换 P0302：二维离散余弦变换的图像压缩，在MATLAB环境下均通过调试-P0301: digital image data display matrix and its Fourier transform P0302: Two-dimensional discrete cosine transform image compression, in the MATLAB environment through debugging

这个也是图形学的一个作业，不过功能比较全面和强大，可以完成基本几何体的造型、多边形化，可以设置场景光源并进行光线跟踪渲染等。启动类为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

数学形态学利里面的灰度腐蚀运算，自己看书写的，通过MATLAB仿真，和标准算法相同。-Lee inside the gray-scale mathematical morphology erosion operation, that looks at writing, through the MATLAB simulation, and standards for the same algorithm

采用各向异性方法 填补一个缺损的轮廓，从而可以得到一个光滑完整的轮廓。- Completed contours correspond to ridges of an extension (ext) of the characteristic function of the uncompleted curve. Anisotropic extension is performed on the characteristic function fbound of an image set given by the binary map boundary to the whole image domain. Extension is initially driven by xi=(EigVect{1}, EigVect{2}) (which should match with the contour tangent direction) computed as the direction of maximum coherence of the distance map to the contour to close. It is updated every N iterations with DCV over the distance map to the ridges/thinning of the evolved image. Two different stop criteria are supported: Number of Connected Components ( numcomp ). Contour Completion. Stop when the extended contour (curve of level 1) has exactly Ncomp connected components. Difference between two consecutive iterations ( tol ) Speed Stabilizes ( speed_stab ). [extended]=ContourComple