ImageTool

用于图像拼接的素材，可用于全景图拼接。主要是JPG形式，可通过SIFT算法进行处理(Material for image stitching, can be used for panorama stitching. Mainly JPG format, can be handled by the SIFT)

这是典型的图像分割Livewire算法的源码 结合OPENCV，配置一下就可以用了(This is a typical source image segmentation algorithm Livewire combination OPENCV, can be used to configure what)

实现“动态”的位图动画，VC++经典编程学习源码，很好的参考资料。(The realization of "dynamic" bitmap animation, VC++ classic learning programming source code, a good reference.)

傅里叶变换及其逆变换的基于VC6.0实现(Fourier transform and its inverse transform)

说明：  Perona和Malik在热传导方程的基础上，建立了各向异性扩散方程并将其应用到了图像处理中尺度空间的图像平滑上，该模型针对图像的边缘部分和非边缘部分进行不同性质的图像处理，同时解算方程的迭代格式简单，克服传统滤波的主要缺陷，是图像质量大为改善，为图像的边缘检测和增强开辟了新的方向。(This process smoothes regions while preserving, and enhancing, the contrast at sharp intensity gradients.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)

对图像进行旋转和缩放的源代码,支持原图像的抽样处理及任意角度的旋转(The image rotation and scaling in any direction)

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.)

此程序为计算雷达目标特性角闪烁特性的函数代码(computing the anglar glint)

对图像进行平滑处理，像各种滤波的方法，如均值滤波法、中值滤波法(Smoothing the image, like the various filtering methods, such as mean filtering, median filtering method)