4

图像的平滑函数，对指定区域的图像，并有门限值和魔板大小限制。(the smooth of a bmp image)

说明：  SAR影像单视数据转为多视数据，数据间相互转化，快捷处理SAR数据(Single-look SAR image data into a more visual data, data inter-conversion, fast processing SAR data)

基于opencv实时图像的2值化处理，一定要有摄像头(Opencv-based real-time image processing of two values, there must be a camera)

图像处理,图像去雨滴、尘土，达到图像恢复的效果，还原图像。(image derain)

VC++图像程序处理 是由杨淑莹老师编写的 对于计算机视觉 等课程有重要作用 (VC++ image processing program written by Yang Shuying teacher courses for computer vision plays an important role)

通过数字图像相关的方法计算两幅图像之间的位移，计算时间较长，是最基础的DIC，没有优化。(Digital image correlation method to calculate the displacement between the two images, the time is longer, is the most basic DIC, no optimization.)

非线性贝叶斯过滤与应用估算和导航，非常不错的粒子滤波英文论文(Nonlinear Bayesian filtering with applications to estimation and navigation)

k均值分类在遥感影像中的应用，完整的c++代码，注释详细易懂，并且已经验证过(k-means classification in remote sensing images in the application, complete c++ code, comments, detailed and easy to understand, and have been verified)

基于vc++6.0的SURF算法的程序代码，可以直接运行(Based on the SURF algorithm for vc++6.0 program code can be run directly)

CGAL，Computational Geometry Algorithms Library，计算几何算法库，设计目标是，以C++库的形式，提供方便，高效，可靠的几何算法。CGAL可用于各种需要几何计算的领域，如计算机图形学，科学可视化，计算机辅助设计和建模，地理信息系统，分子生物学，医学成像，机器人运动规划，网格生成，数值方法等等。 　　 计算几何算法库（CGAL），提供计算几何相关的数据结构和算法，诸如三角剖分（2D约束三角剖分及二维和三维Delaunay三角剖分），Voronoi图（二维和三维的点，2D加权Voronoi图，分割Voronoi图等），多边形（布尔操作，偏置），多面体（布尔运算），曲线整理及其应用，网格生成（二维Delaunay网格生成和三维表面和体积网格生成等），几何处理（表面网格简化，细分和参数化等），凸壳算法（2D，3D和dD），搜索结构（近邻搜索，kd树等），插值，形状分析，拟合，距离等。(The goal of the CGAL Open Source Project is to provide easy access to efficient and reliable geometric algorithms in the form of a C++ library. CGAL is used in various areas needing geometric computation, such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, robotics and motion planning, mesh generation, numerical methods... More on the projects using CGAL web page. The Computational Geometry Algorithms Library (CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations, and Delaunay triangulations and periodic triangulations in 2D and 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi diagrams, and segment Voronoi diagrams), polygons (Boolean operations, offsets, straight skeleton), polyhedra (Boolean operations), arrangements of curves and their applications (2D and 3D envelopes, Minkowski sums), mesh generation (2D Del)