jpegyasuo

本程序利用SIFT算法实现影像匹配的基础上，实现全景图的拼接，实用性很强，大家可以把拍摄的相邻的几张有重叠度的照片拼接成一张全景图。(The program uses SIFT image matching algorithm based on the realization of panorama stitching, very practical, we can put a few have taken the overlap of adjacent photos into a panoramic mosaic map.)

说明：  使用贝叶斯算法进行图像分割，迭代法寻找最佳阈值(Bayesian algorithm is used for image segmentation, and iterative method is used to find the best threshold)

这是一篇讲述最新的干涉图处理的关键技术的文章，非常实用！(This is an article about the latest key interferogram processing technology is very useful!)

说明：  这是一本关于电子情报雷达信号分析的电子版，主要内容包括电子情报的特征和基础、模拟和数字系统的信噪比考虑、信号功率、极化、波数分析、天线扫描分析、脉内分析、脉冲重复间隔分析、载频分析、脉冲串去交错、确定elint参数的极限以及elint数据文件 (This is an electronic intelligence on the radar signal analysis of the electronic version, the main contents include the characteristics of electronic intelligence and infrastructure, both analog and digital system signal to noise ratio considerations, signal power, polarization, wave-number analysis, antenna scanning analysis, pulse analysis , pulse repetition interval analysis, analysis of carrier frequency, pulse staggered string to determine the limits of the parameters, as well as ELINT ELINT Data Files)

它所描述的是不同色彩在整幅图像中所占的比例，而并不关心每种色彩所处的空间位置，即无法描述图像中的对象或物体。颜色直方图特别适于描述那些难以进行自动分割的图像。(It describes the proportion of different colors in the entire image, and does not care about the spatial location of each color, that is, it can not describe objects or objects in the image. Color histograms are especially suitable for describing images that are hard to segment automatically.)

用于脸部识别时，使用基于像素和区域的图像特征核的稀疏表示的识别算法。(When used in face recognition using image recognition algorithm based on feature pixel and regional nuclear sparse representation.)

选择某一个目录，将某一个目录下的所有图片读取出来 并以缩略图的形式展现

matlab平台实现平移的亚像素配准，精度0.03像素(matlab platform translation sub pixel registration accuracy of 0.03 pixels)

这是一个surf特征匹配matlab程序，里面有实例和测试图像(This is a surf feature matching matlab program, there are examples and test images)

图着色问题（Graph Coloring Problem, GCP）又称着色问题，是最著名的NP-完全问题之一。路线着色问题是图论中最著名的猜想之一。(Graph coloring problem (Graph Coloring Problem, GCP), also known as coloring problem, is the most famous NP-complete problems. Line graph coloring problem is one of the most famous conjecture.)