MATLAB模糊聚类的图像分割算法的源代码

对图像Gabor特征的提取，一个非常有效的特征,并用SVM对图像进行分类 99142375gist

一个简易的图片浏览器-a simple photo browser

模拟三维地形的3D动画，很有意思，可供参考！-Three-dimensional topography simulation of 3D animation, very interesting, for reference!

中点分割裁减算法的实现，ＶＣ＋＋，左键画出任意条直线，右键画出矩形进行裁减-midpoint of the segmentation algorithm to achieve reductions, VC++, painted arbitrary menu of straight lines, right-painted rectangle for the reduction

e book for statistical signal processing estimation and detection.

《visual c++ 数字图像编码》配套程序-"visual c digital image coding" complementary procedures

OUT CAD2004适用书籍，适用于各初学者 是入学的首选。-OUT CAD2004 applies to books, is applicable to all school of choice for beginners.

本程序是建立了三维椭球随机分布模型，并绘制出分布图像。-This procedure is to establish a three-dimensional ellipsoid model of random distribution, and to map out the distribution of the image.

C++Builder实现图象的百叶窗效果，原理简单，运行速度快，效果很好。-C Builder Image louver effects and is simple and fast operation and the results very good.

Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulated as a quadratic assignment problem (QAP). Although widely used, solving the correspondence problem through GM has two main limitations: (1) the QAP is NP-hard and difficult to approximate; (2) GM algorithms do not incorporate geometric constraints between nodes that are natural in computer vision problems. To address aforementioned problems, this paper proposes factorized graph matching (FGM). FGM factorizes the large pairwise affinity matrix into smaller matrices that encode the local structure of each graph and the pairwise affinity between edges. Four are the benefits that follow from this factorization: (1) There is no need to compute the costly (in space and time) pairwise affinity matrix; (2) The factorization allows the