FTAlianxu

hough变换检测椭圆，先进行二值化检测边缘(hough u53D8 u6362 u68C0 u6D4B u692D u5706 uFF0C u5148 u8FDB u884C u4E8C u503C u5316 u68C0 u6D4B u8FB9 u7F18)

PCL库的C#封装，用于点云的处理，包括点云读取，显示，分割，分类，聚类等(C# wrapper of point cloud library.)

图像融合评价程序，通过均值，标准偏差，熵，梯度，相关系数，光谱扭曲度等多个指标对融合图像进行评价比较。(image fusion evaluation procedures, the mean, standard deviation, entropy, gradient, and the correlation coefficient. spectral distortion degree of integration of various indicators to evaluate the comparative images.)

这个matlab程序实现了基于SPIHT多级树集合分裂的图像压缩算法。 (Matlab implementation of this procedure based on the SPIHT multi-level set to split the tree image compression algorithm.)

：植物种类识别方法主要是根据叶片低维特征进行自动化鉴定。然而，低维特征不能全面描述叶片信息，识别准确率低，本文提 出一种基于多特征降维的植物叶片识别方法。首先通过数字图像处理技术对植物叶片彩色样本图像进行预处理，获得去除颜色、虫洞、 叶柄和背景的叶片二值图像、灰度图像和纹理图像。然后对二值图像提取几何特征和结构特征，对灰度图像提取 Hu不变矩特征、灰 度共生矩阵特征、局部二值模式特征和 Gabor 特征，对纹理图像提取分形维数，共得到 2183 维特征参数。再采用主成分分析与线性 评判分析相结合的方法对叶片多特征进行特征降维，将叶片高维特征数据降到低维空间。使用降维后的训练样本特征数据对支持向量 机分类器进行训练(plant species identification method is mainly based on blade automatic identification of low dimensional characteristics.However, can not fully describe blade low-dimensional feature information, identification accuracy is low, in this paper A kind of plant leaves recognition method based on multiple feature dimension reduction.First by digital image processing technology to the plant leaf color sample image preprocessing, obtain background color removal, wormhole, petioles, and the blades of a binary image, gray image and texture image.Then the binary image to extract the geometric characteristics and characteristics of structure and characteristics of gray image extraction Hu moment invariants, gray co-occurrence matrix feature, local binary pattern features and Gabor, to extract the fractal dimension of texture image, get 2183 d characteristic parameters.By principal component analysis and linear uation analysis method of combining the characteristics of blade more feature dimensi)

说明：  立体匹配包含SAD SSD NCC 区域增长 census等多种常用立体匹配算法(Stereo matching includes SAD SSD NCC area growing census and other commonly used stereo matching algorithms)

在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)

说明：  掌纹识别代码，对图像预处理和特征提取及匹配(Palmprint identification code, the image preprocessing and feature extraction and matching)

在google earth engine云平台对影像进行自动分类提取，需要手动输入样本及研究区(Automatic image classification and extraction on Google Earth engine cloud platform requires manual input of samples and research areas)

方向梯度直方图的全部代码，广泛应用于行人检测行人检测(Histogram of Oriented Gradients code Pedestrian Detection)