TestCamWin32

bresenham画直线，WIN32，计算机图形学基础类源代码(bresenham画直线)

采用最大方差阈值分割法，对指纹进行提取。(Using the maximum variance threshold segmentation method for fingerprint extraction.)

利用c++实现图像转置源代码，像素变换的一种方式(use Image home to the source code, pixel transform the way)

用Visual C++实现基于数学形态学的数字图像处理,包括二值图像的腐蚀,膨胀,开,闭,细化及中轴变换等运算.(Visual C++ using mathematical morphology-based digital image processing, including binary image erosion and dilation, opening, closing, thinning, and the central axis transform operations.)

针对图像秘密共享前需要像素置乱的问题，基于(t, n)门限多重秘密共享思想，提出一种免置乱的图像秘密共享方案，以第n+1人的秘密份额作为因子参与秘密分割与重构，加大相邻像素之间的差距(Based on (t, n) threshold multiple secret sharing ideas, and put forward a kind of scrambling image from secret sharing scheme to n+ 1 people share the secret as factors involved in secret segmentation and reconstruction, increase the gap between adjacent pixels)

多边形的合并算法，该算法能够实现任意两个多边形（包括凹多边形）的合并.( The polygon merge algorithm, this algorithm can realize wilfully two polygons (including concave polygon) merge )

sift匹配算法 尺度不变变换 特征描述子 特征点匹配 (sift match)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(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)

利用大津算法对图片进行处理，得到满意的处理效果。(The image is processed by Otsu algorithm and satisfactory results are obtained.)

小波算法。机械化的提高我们的效率。让我们减少错误率。大家要对她有性心。(Wavelet algorithm. Mechanization to improve our efficiency. Let us reduce the error rate. We have to have sex to her heart.)