遥感图像分类工具箱Active-Learning

图像拼接程序，可以实现几幅图像的拼接，其原理是基于Lowe教授提出的SIFT特征算法。该方法非常有效，通过两两图像进行配置后，采用融合技术，得到拼接后的全景图(This is code for image mosaic based on SIFT algorithm，it is very useful for learning image process.)

线性插值射线追踪法，设置模型为一三层模型，范围100m×100m(Linear interpolation ray tracing method, set the model for a three-tier model, the range 100m100m)

基于分数阶傅里叶变换的五篇博硕士论文，分别是在数字水印中的应用两篇，图象变换中的应用一篇，滤波中的应用一篇，目标检测中的应用一篇。(Based on Fractional Fourier Transform five Theses, respectively, in the digital watermark in the application of 2, images in the application of a transformation, filtering in the application of a target detection application 1.)

雷达信号处理基础教程，对雷达信号基础处理技术提供了简洁、统一、现代的表述，包括信号模型、匹配滤波、脉冲压缩、多普勒处理，阈值检测等。(Fundamentals of Radar Signal Processing)

说明：  基于内容的图像检索，包括纹理、形状、颜色(Content-based image retrieval, including texture, shape, color)

数字图像处理技术 边缘检测 Canny sobelC# 数字图像处理技术 边缘检测 Canny sobelC#(Digital image processing technology edge detection Canny sobelC# digital image processing technology edge detection Canny sobelC#)

SUN：利用自然统计的显著性贝叶斯检测框架。一种自底向上的检测图像的显著性区域方法。(SUN: A Bayesian Framework for Saliency Using Natural Statistics)

利用最佳直方图熵法（KSW熵法）及穷举法实现灰度图像阈值分割(The best the histogram entropy method (KSW entropy method) and the brute-force method to achieve gray image threshold segmentation)

用MATLAB对两幅图片进行图像匹配,程序运用了两种匹配算法:1.sad算法2.ssad算法3.的采用界面输入输出方式.(MATLAB to two picture image matching, and the program using the two matching algorithms: 1. Sad algorithm 2.Ssad algorithm of the input and output interface mode.input/output mode.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用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.)