对指定区域进行填充

扩展的CSPLITTERWND视窗分割代码,对MDI和SDI不熟的朋友可以参考-expansion CSPLITTERWND Windows code division of MDI and SDI are unfamiliar with the reference can be friends

一个显示磁盘文件的例子，类似资源管理器左半部分-a disk file shows examples similar resource-management part of the Left

武汉大学遥感信息工程学院实习程序，包括多种锐化平滑边缘检测算法，仅供学习参考

手写数字识别之模板匹配法 识别手写数字-Handwritten numeral recognition template matching of handwritten numeral recognition

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

java语言实现的简单的调色板程序-the simple palette procedures

这是一个基于神经网络法的字符识别系统，神经网络法的使用使本系统识别率很高。-This is a neural network based on the character recognition system, neural network to enable the use of the system to identify high rate.

神经网络训练，可参考相应的文章，杜达《模式分类》等

关于数字图像处理方面-of digital image processing

人脸识别匹配的源代码，并配有部分人脸照片，欢迎下载学习-The source code of Face recognition , with some face photos, welcome to learn.