Houghtranslate

计算多边形面积的算法(polygon area calculation algorithm)

这个是图像处理中的hough变换的C++源代码，工需要的同学参考学习。(This is the image processing hough transform C++ source code, engineering students need to learn.)

读取RAW格式文件，将其转换为BMP格式文件并存储，主要实现灰度图像的转换(Read the RAW format, convert it to BMP format file and stored, mainly to achieve the conversion of grayscale images)

像素级融合实现 pca his，brovery加权融合方法，很不错(Pixel level fusion to achieve pca his, brovery weighted fusion method, very good)

三维最大Renyi熵的灰度图像阈值分割算法(Maximum Renyi entropy of three-dimensional gray-scale image segmentation algorithm)

设置位置断点跟踪程序，VC++精选编程源码，很好的参考资料。(Set breakpoint location tracking procedures, VC++ programming source code, a good reference.)

图形图像处理软件 MFC 功能强大 OpenVC 武汉大学出品(MFC graphic image processing software produced powerful OpenVC Wuhan University)

实现“动态”的位图动画，VC++经典编程学习源码，很好的参考资料。(The realization of "dynamic" bitmap animation, VC++ classic learning programming source code, a good reference.)

对图像（Bmp）的智能读入界面设计，源代码(Read image (BMP), intelligent interface design, source code)

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