gray2rgb

基于C#上的EMGUCV编写的SIFT算法的代码，自己修改匹配库的文件图片即可，支持显示SIFT的关键点(EMGUCV C# based on SIFT algorithm written in code, make changes to the document image to match the library, support the display of the key points SIFT)

图像融合技术，对可见光图像与红外图像进行融合。(Image fusion, image visible and infrared image fusion.)

说明：  SIFT用于图像全景拼接的源码，内附算法描述，很好用。(SIFT source code for image panorama stitching, containing algorithm descriptions, easy to use.)

说明：  二进小波变换的图像增强,matlab代码(Dyadic wavelet transform image enhancement, matlab code)

CV模型源代码, 用水平集进行图像分割。一个经典的算法。(matlab source code of CV model)

matlab中实现grabcut，已经编译调试好了，直接运行就可以了(the code of grabcut,you can run it in matlab without debug)

说明：  matlab使用regionprops求面积，找到连通域(Matlab uses regionprops to calculate area and find connected region)

matlab OTSU 简易的大津算法 求最佳阈值的。(matlab simple algorithm seeking Otsu threshold.)

对采集到的干涉条纹进行二值化，形态学细化等基本处理(The collected interference fringes binarization, thinning and other basic morphological processing)

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)