图像匹配，将两幅不同的角度拍的图像的对应点都找到as

matlab代码实现的retinex图像增强(retinex image enhancement matlab code)

卡尔曼滤波的一个典型实例是从一组有限的，包含噪声的，对物体位置的观察序列（可能有偏差）预测出物体的位置的坐标及速度。在很多工程应用(如雷达、计算机视觉)中都可以找到它的身影。同时，卡尔曼滤波也是控制理论以及控制系统工程中的一个重要课题。(A typical example of the Kalman filter, from a limited set, containing the noise, the position of the object observed sequence (there may be deviation) to predict the coordinates of the location and speed of the object. Its presence can be found in many engineering applications (such as radar, computer vision). Meanwhile, the Kalman filter is control theory, and control is an important topic in systems engineering.)

该文档描述了如何使用sketchup制作3D模型，并上传到google的3D仓库。(This document describes how to create 3D models using sketchup and uploaded to google' s 3D warehouse.)

计算图像的几何不变矩—Hu矩，以及图像的相似度，在vc下实现。(Calculate the geometric image invariant moments-Hu moments, as well as the similarity of the image, achieved under vc.)

利用改进的“参考白”算法对彩色图像进行光照补偿(Using improved "reference white" algorithm to compensate illumination of color image.)

采用最大方差阈值分割法，对指纹进行提取。(Using the maximum variance threshold segmentation method for fingerprint extraction.)

EDLines是一种快速直线检测算子，2012年在ICCV上提出，也是目前处理直线检测最快的算法之一，该算法包含三个步骤：（1）边缘提取：利用Edge Drawing (ED)算法[28,29]从灰度图像中提取边缘片段；（2）线段检测：利用最小二乘法提取直线段；（3）线段确认：遵循Helmholtz定律，从已提取的直线段中摒弃虚假线段。EDLines算法的优越性得益于Edge Drawing (ED)算法能够从灰度图像中准确、快速、稳定地提取出光滑、完整的边缘片段。Edge Drawing (ED)算法包含以下步骤： （1）采用size=5*5,σ=1的高斯核对灰度图像进行平滑滤波，去除噪声； （2）采用一种常用的梯度算子，如Prewitt、Sobel或Scharr等计算平滑后图像中每个像素点的梯度幅度和梯度方向； （3）将梯度图中邻域内幅度最大的像素点标记为锚点，这些锚点成为图像边缘点(edge elements)的概率很大； （4）将相邻的锚点连接成边缘线。从一个锚点起始，ED利用相邻像素的梯度幅度和方向在梯度为最大值的锚点之间游走。 (Edge Drawing (ED) is our recently-proposed, novel, fast edge detection algorithm. What makes ED stand out the existing edge detectors, e.g., Canny, is the following: While the other edge detectors give out a binary edge image as output, where the etected edge pixels are usually independent, discontinuous entities ED produces a set of edge segments, which are clean, contiguous, i.e., connected, chains of edge pixels. Thus, while the output of the other edge detectors requires urther processing to generate potential object boundaries, which may not even be possible or result in inaccuracies ED not only produces perfectly connected object boundaries by default, but it also achieves this in blazing speed compared to other edge detector.)

在一个具有几个顶点的连通图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.)

基于阴影形成的原理及阴影区域的特点，研究阴影区域的特征表示方法； 基于阴影区域特征设计或改进阴影检测方法，检测出户外图像中的阴影区域； 在检测出阴影区域的基础上，研究阴影去除方法； 编程实现相关方法并进行实验验证及分析。(Shadow detection and removal of single image)

用于提取图像的Zernike矩特征，从而实现目标识别，可运行(Used to extract the image of the Zernike moment characteristics, so as to realize target identification, can run)