demo

利用VTK实现图像的放大缩小，基于对话框编写的，有助于学习VTK的朋友(Using VTK to achieve the image to zoom in, based on the dialog box, prepared to help a friend learn VTK)

里面包括了MATLAB的好多程序,主要有灰度切分，直接灰度变换，直方图规定化，直方图均衡化等(Which includes many of the MATLAB program, there are gray-scale segmentation, direct gray-scale transformation, Histogram of the provisions of, such as histogram equalization)

核聚类算法KFCM源代码，对传统FCM算法的改进(Nuclear clustering algorithm KFCM source code, the traditional FCM Algorithm)

通过sift算法进行图像配准，配准效果好，精度高(Image registration algorithms sift through the good registration results, high precision)

raw 数据转换成plant 的yuv 数据，已经测试通过。希望对raw数据进一步处理的同学有帮助。( Raw data is converted into YUV plant data, has been tested through. Hope that the raw data to further deal with the students to help. )

地图代数距离变换，八边形距离变换，马哈顿距离变换(Map algebra distance transform, eight sided distance transform, distance transformation)

这个是图像处理中的hough变换的C++源代码，工需要的同学参考学习。(This is the image processing hough transform C++ source code, engineering students need to learn.)

经典的文本水印算法，实现了别人实现不了的功能，希望大家有所用！(The classic text watermarking algorithm to achieve the functions of others fail to realize, I hope you all have a use!)

关于计算机视觉和图像的matlab工具箱。包括相位一致性特征，空间特征检测，积分图像，非极大值抑制和滞后阈值，边链接和线段拟合，去噪，等(MATLAB and Octave Functions for Computer Vision and Image Processing。such as • Feature Detection via Phase Congruency • Spatial Feature Detection • Integral Images • Non-Maxima Suppression and Hysteresis Thresholding • Edge Linking and Line Segment Fitting • Test Grating for Edge Detection • Image Denoising • Surface Normals to Surfaces • Scalogram Calculation • Anisotropic diffusion • Grey Scale Transformation and Enhancement • Frequency Domain Transformations • Functions Supporting Projective Geometry • Feature Matching • Model Fitting and Robust Estimation • Fingerprint Enhancement • Interesting Synthetic Images • ASCII Image Generation • Rotation Transforms • Image Blending • Colourmaps and colour conversions • Image Display, Image Writing and Miscellaneous )

在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)