Digital image processing deal with the mean value of histogram equalization deal

质量不错的OCR源码。这是国外很有名的开源OCR，研究OCR的同好一定要支持啊。-OCR source good quality. This is a well-known open source abroad OCR, the OCR research enthusiasts must support ah.

《医学图象的曲面重建》 为浙江大学博士学位论文。此文对医学数据的表面重建进行了详细的阐述，主要针对Marching Cubes算法提出了他自己独到的理解和理论创新。并且详细的论述了相关领域的多种算法理论。-"medical image reconstruction of the surface" of Zhejiang University for a doctorate thesis. The article on the medical data of the surface reconstruction of detailed, targeted at Marching Cubes of his unique understanding and theoretical innovation. And are discussed in detail in the related fields of various theoretical algorithm.

该算法建立了由最小二乘法,离散点曲率和离散点曲率变化和三项组成的目标函数并求出了最优控制点序列坐标,采用非线性优化方法对权因子序列进行了调整,确立了逼近误差的近似表示方法,并提出了包括上述方法的循环判断流程.-The algorithm was established by the least squares method, discrete points, the curvature and the curvature change and the three discrete points consisting of the objective function and find the optimal sequence of control point coordinates, using non-linear optimization method for sequence weights have been adjusted establishes the approximation error of the approximate representation, and proposed, including the cycle of the above methods to determine flow.

图形常见变换如维纳、中值滤波 小波变换，加噪，复原等处理要求图像为256色-common graphics transformation as Wiener, the median filter wavelet transform, increase noise, rehabilitation processing requirements for the 256 color images

本程序实现的是文字识别中的文字切分环节，用基于连通域的文字切分算法实现-This procedure is the realization of the text character recognition segmentation aspect connected with the text-based segmentation algorithm

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

一个日文手写识别源码，有较高的参考价值。-a Japanese handwriting recognition source, a high reference value.

一个非常好的对BMP图像进行操作的程序框架-A very good image of BMP operation Framework

virual c++程序，实现的简单绘制直方图

分形图像处理源代码-fractal image processing source code