1111222223333334444445533332345554

VisualC++数字图像处理技术详解第2版光盘-第八章 分水岭分割算法(VisualC++ digital image processing technology Detailed Version 2 CD- Chapter VIII watershed segmentation)

一个集成的图形界面的程序，可调用每一次作业子程序。 一、调用画点的函数，用DDA、中点算法画直线和中点算法画圆和椭圆。 二、多边形扫描转换算法和区域填充算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法为任选；基于种子的区域填充采用4连通区域的递归种子填充算法，或扫描线种子填充算法，要求种子点(x,y)可交互输入）。 三、线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。 四、用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括类似自行车行走和绕固定点旋转的自旋转物体动画。） 五、简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。 六、交互式Bezier曲线的输入绘制程序实现 (An integrated graphical interface of the program, each operation subroutine callable. One call a function of the point of the painting, with the DDA, the midpoint algorithm for drawing a straight line and the midpoint algorithm circle and oval. Second, the polygon scan conversion algorithm and region filling algorithm (scan line algorithm for must fill and edge flag algorithm based on the edge of the modulo operator is optional using the 4 regional connectivity recursive seed filling algorithm based on the area of seed filling, or scan line seed filling algorithm requires the seed point (x, y) can be entered interactively). Line Clipping polygon clipping algorithm animation achieved. (Two Line Clipping Algorithm and HS polygon-by-side clipping algorithm) polygon clipping algorithm animation requires draw a closed polygon, rectangle and then draw the crop window, and then select the the cropped button (or command), press the "on top of cutting "button (or the implementation of)

FK滤波分析，设计窗口！！！！！！！！！！！(FK filtering analysis, design window! ! ! ! ! ! ! ! ! ! !)

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

本压缩包有canny算子的源程序代码和测试图片。(The archive has canny operator of the source code and test images.)

人脸检测：可自动检测人脸，速度还可以吧！(Face Detection : can automatically detect faces and can also speed!)

图像分割源码，是一种基于图论的方法做的。分割的质量超好，不信的话下载下来看，你就清楚了！(Image segmentation source code, is a method based on graph theory to do. Segmentation quality is super good, do not believe it download the next run, you will be clear!)

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

1.本程序功能包含显示直方图，OTSU的单值分割，OTSU的二值分割,OTSU的三值分割 2.在OTSU的分割时，通常情况下我们是通过类间方差得到一个分割阈值，但是有时候我们需要得到各灰度级别的目标，那么采取多值分割是 很必要的，通过改进得到OTSU的多值分割方法 3.本程序另外还有显示直方图，计算程序运行时间，处理结果以新的窗口显示等细节，这部分适合MFC初学者。(1. This procedure shows the histogram feature, OTSU single segmentation, OTSU binary segmentation, OTSU three segmentation 2. OTSU segmentation, it is usually the case we are through the between-cluster variance by a partition threshold , but sometimes we need to be the gray level of the target, then the multi-segmentation is necessary, through improved access to multi-OTSU segmentation methods 3. This procedure in addition to show the histogram to calculate run time, treatment the results of a new window display the details of this part of MFC for beginners.)

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