wpf 简单的滑动实例

本程序通过水平和垂直灰度投影，框选出灰度面部图像中的眼睛区域。(This program is used to locate eye region in gray facial image by means of horizontal and vertical projection.)

说明：  一款实用的滤波器设计软件，有助于自行设计滤波器时作参考 (A practical filter design software, will help to design filters for reference)

传统的HSV空间颜色特征提取算法，量化为8H3S3V.(HSV color space for the traditional feature extraction algorithm, to quantify 8H3S3V.)

通过执行程序，可以实现对物体视差图的生成，进而可以实现深度图。(Through the implementation of the program, you can achieve the object disparity map, and then you can achieve depth map.)

SIFT图像配准，已测试比较好用，请大家放心使用(SIFT image registration)

Wily book Digital Image processing fundamental dip

c++实现的sift，可以分步观看实现效果(c++ implementation of the sift, you can watch step by step to achieve results)

说明：  实现了三种图像匹配算法 1：归一化互相关匹配算法 2：基于Hausdorff距离的图像匹配算法 3：图像不变矩匹配算法(Three matching algorithms to achieve 1: normalized cross correlation matching algorithm 2: the image matching algorithm based on Hausdorff Distance 3: Image Invariant Moment Matching Algorithm)

说明：  利用97小波变换进行图像压缩，用matlab仿真，实验证明它具有较高的压缩比(using wavelet transform image compression using Matlab simulation experiment to prove that it has a higher compression ratio)

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)