main

计算两幅图像之间的交叉熵，自己编的比较简单和大家分享。(Calculate the cross-entropy between the two images, their own series is relatively simple and to share.)

一种使用牛顿迭代的超分辨算法，该算法以2的对数提高传统Landweber算法的运算速度，附带文章。(The problem of poor resolution of acquired image in the passive millimeter wave imaging stems mainly from antenna size limitations, thus necessitating efficient post-processing to achieve resolution improvements. A novel image super-resolution algorithm, Regularized-Newton-Residual (RNR) algorithm, is proposed for Passive Millimeter wave imaging (PMMW). First Newton inversion algorithm is introduced into the field of image restoration. The iterative scheme of Newton algorithm is deduced based on normal equation. Then, residual method is employed to achieve better performance and implement spectrum extrapolation. Experimental results demonstrate the algorithm is insensitive to noise distribution. Furthermore it has high super-resolution rate and fast convergence speed. )

哥伦比亚大学灰度拼接图像库，用于拼接图像统计特征的检测等相关研究(Studies at Columbia University gray mosaic image library for image stitching feature detection statistics)

一个具备线，矩形，椭圆的画图程序，可以设置颜色，宽度，字体(One with lines, rectangles, ellipses drawing program, you can set the color, width, font)

本篇论文主要介绍地基云的自动检测！采用阈值分割！(This paper describes the automatic detection of the foundation of cloud! Using thresholding!)

自适应卡尔曼滤波 英文参考文档资料 含有matlab例程(Adaptive Kalman filtering English reference documentation contains matlab routine)

Code for make histogram of image

本人用matlab自己做的图像分裂合并程序，主要对印章图像进行处理．(own image split the merger process, mainly to seal image processing.)

对ecg信号进行预处理，并检测ecg的r波，并进行特征提取，并在图中进行标注(On ecg signal preprocessing and detection of r ecg wave, and feature extraction, and marked on the drawing)

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