Features2D_Homography

实现BMP文件的基本功能。用C++实现一个Class，该Class具有读写BMP文件功能；该Class还具有对图像像素进行操作的功能（针对每个像素的读、写） (BMP files to achieve the basic functions. Using C++ implementation of a Class, the Class has read and write BMP file functions the Class also features the image pixel operation function (for each pixel of the read, write))

说明：  图像检索的的基于语义的图像检索 纹理图像检索 图像的特征提取方法(Image Retrieval of semantic-based image retrieval image retrieval image texture feature extraction methods)

提取SIFT特征，进行特征提取和匹配，包括特征点的定位，特征点描述子的生成，特征点的匹配，(extract SIFT feature，and feature matching)

C#处理数字图像集锦，有图像旋转、平移等变换，有图像编码，有图像解码，有数字图像处理那本书里的各种算法(C# processing the digital image gallery, image rotation, translation, transformation, and image coding, image decoding, digital image processing various algorithms in the book)

实现原始的JPEG图片编解码，不借助任何的第三方库，纯C++。(To achieve the original JPEG image decoding, without using any third-party libraries, pure C++.)

visual c++ 工具 c语言 实现的灰度共生矩阵。(visual c++ tool c language GLCM.)

关于CCD相机的选型，帧率，幅宽，曝光时间(CCD CAMERA)

C语言实现bmp图像放大缩小，24位bmp图像(The C language bmp image zoom, 24 bmp image)

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)

利用k—mean算法根据U、V进行聚类分块，最后完成图像分割，分割出得块用不同的灰度等级表示出来。(K-mean algorithm to cluster sub-blocks according to the U, V, to finalize the image segmentation, segmentation have blocks with different gray levels represented.)