vc_captrue

说明：  在地震处理中，非常经典的进行时深转换的程序，通常比较好用(In seismic processing, the very classic procedure for time-depth conversion, usually more useful)

一个集成的图形界面的程序，可调用每一次作业子程序。 一、调用画点的函数，用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)

用CUDA并行处理方法改写的图像降噪算法，包括KNN,NLM,以及改进的NLM方法。配置环境适合VS2010+CUDA5.0,对使用CUDA的同学来说是很好的教材。(Image denoising algorithms including KNN,NLM and refined NLM run on CUDA, useful demo for who learns CUDA based parallel programming.)

重要的纹理分割分类基础程序，可以进行更深入的探讨和优化，应用于遥感影像中。(Important basis for classification of texture segmentation procedure can be carried out more in-depth exploration and optimization, application of remote sensing images.)

本程序实现了对影像特征点自动提取，利用Morevac、Forstner、Harris3个经典算子。在此基础上利用相关系数法实现影像自动匹配，并且引入最小二乘平差，使匹配点精度有所提高。 在搜索点过程中，利用了核线影像特性，对二维影像搜索使用了爬山法启发式搜索。对大数据量影像采用影像金字塔结构处理。 1、使用GDAL库读取影片，支持TIFF、PNG、JPEG、JPG、BMP、GIF、IMG格式读取。使用GDI绘图。 2、防止大数据量绘图视图闪烁，图片显示采用双缓存技术。 3、保存视图数据为图片文件，支持TIFF、PNG、JPEG、JPG、BMP、GIF格式保存。 4、TreeCtrl控件、ListCtrl控件的基本操作。 5、MFC单文档程序视图通讯、更换视图、视图分割。(This program of image features automatic extraction point, use Morevac, Forstner, Harris3 a classic operator. Based on the correlation coefficient method using the image matching, realization and introducing least squares adjustment, the matching point to improve precision. In the search process, the use of the image characteristics of nuclear line, 2d image search using the heuristic method of climbing. For large quantity of data using image processing image pyramid structure. 1, using film, read GDAL repository support JPEG, TIFF, PNG, GIF, BMP, JPG, read IMG format. Use GDI drawing. 2 and prevent large amount of data, drawing view pictures showed adopt double caching techniques. 3, save for the image file, views data support JPEG, TIFF, JPG, PNG, GIF, BMP format. 4 and TreeCtrl controls, the basic operation ListCtrl controls. 5 and MFC single document procedure view communication, replace view, view.)

数字图像处理中常用的标准图像，包括大家所共知的lena等图片的高分辨率版本，推荐大家下载(Commonly used in digital image processing standard images, including all the known to the lena and other high-resolution version of the picture, we recommend downloading)

表面张力CSF模型，用于计算微重力条件下的两相流问题。(Comtinum Saface tension Force)

对图像进行旋转和缩放的源代码,支持原图像的抽样处理及任意角度的旋转(The image rotation and scaling in any direction)

本程序利用SIFT算法实现影像匹配的基础上，实现全景图的拼接，实用性很强，大家可以把拍摄的相邻的几张有重叠度的照片拼接成一张全景图。(The program uses SIFT image matching algorithm based on the realization of panorama stitching, very practical, we can put a few have taken the overlap of adjacent photos into a panoramic mosaic map.)

说明：  用VC开发的图形填充算法，简单实用， 希望对你的图形开发有所帮助， 如果有什么问题，可以与我联系(development of the VC graphics filling algorithm, simple and practical, and I hope to your graphics development will help, if any, can contact me)