hog

基于灰度共生矩阵的纹理特征提取。特征参数为：熵，能量，(GLCM-based texture feature extraction. The characteristic parameters: entropy, energy,)

这是一个人脸识别系统，其中详细的给出了人脸识别软件的开发过程，应用MATLAB编程实现，是一个不可多得的好软件。(This is a face recognition system, which gives a detailed Face Recognition software development process. MATLAB programming is a very good software.)

图形图像处理算法大全，包含各种算法的源码，只要经过简单修改就可变为程序(Daquan graphic image processing algorithms, including the source code for various algorithms, as long as you can into a program after a simple modification )

基于全变分（TV）的多光谱遥感图像恢复。当多光谱图像中一个通道模糊时，利用其它通道的图像特征辅助进行去模糊或反卷积，效果不错！！附带有对应的文章做参考。(This is a new image restoration or deconvolution method, which uses one of clear band image to constraint Total Variation de-blurring of degraded band image in multispectral image. It tested with different noise with different regularization parameters. It also compared with otherhods.)

傅里叶描述子用来描述和识别图像中有边缘的物体形状，本程序基于MATLAB，测试可用(Fourier descriptor is to analyze and identify the important objects in the shape of one of the methods. The use of polygon-based curve near Continuous Fourier transform method like Fourier descriptors, and through the main direction of the shape to eliminate the border from Phase of the influence of starting point, define a new rotation, translation and scale invariance of the normalized Fourier Ye descriptor.)

图像处理c源码_功能是打开一幅位图_并显示在屏幕上(_ C source image processing function is to open a bitmap _ and displayed on the screen)

包内提供了Contourlet和Wavelet变换进行图像增强、去噪的各种算法和.m文件，的确是好东西。(Package provides a Contourlet and Wavelet Transform for image enhancement, denoising the various algorithms and. M file, it is a good thing.)

自己编写的三维目标跟踪粒子滤波程序，比较基本，可以帮助学习理解。(I have written three-dimensional target tracking particle filtering procedures, basic, can help study and understand.)

说明：  实现pca主成分分析算法的c语言代码，希望能帮到大家。(Pca principal component analysis algorithm to achieve the c language code, hope to help you.)

在一个具有几个顶点的连通图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.)