testArea

说明：  LSA的第一步是要去创建词到标题（文档）的矩阵。在这个矩阵里，每一个索引词占据了一行，每一个标题占据一列。每一个单元（cell）包含了这个词出现在那个标题中的次数。例如，词”book”出现在T3中一次，出现在T4中一次，而”investing”在所有标题中都出现了一次。一般来说，在LSA中的矩阵会非常大而且会非常稀疏（大部分的单元都是0）。这是因为每个标题或者文档一般只包含所有词汇的一小部分。更复杂的LSA算法会利用这种稀疏性去改善空间和时间复杂度。(The Little Book of Common SenseInvesting: The Only Way to Guarantee Your Fair Share of StockMarket Returns ,)

实现了Thien在他的文章《secret image sharing》中提出的（r，n）门限秘密图像分存方案。 (Thien in his article " secret image sharing" (r, n) Door Threshold Secret Image Sharing Scheme.)

基于halcon图像处理平台的相机标定算法，相当不错。。。。。(Halcon based image processing system camera calibration algorithm is quite good. . . )

说明：  Jpeg算法源代码，包含jpeg的各种算法实现的vc++的源代码(Jpeg algorithm source code, including the various algorithms jpeg of vc++ source code)

人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测人脸检测(Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection Face Detection)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)

基于MATLAB的车牌识别系统的源代码(可以实现)(The source code of the license plate recognition system based on MATLAB (can be realized))

利用位图图像中的冗余数据位，将小文件嵌入到大的图像文件中，并保持原图像不变。(The use of bitmap images in the redundant data bit will be embedded in small files to large image files, and to maintain the original image unchanged.)

点云读取，旋转，平移，缩放，统统是包含全视图的各种视图的显示(Point in put)

Image_processing in C