小波去燥

源码包括了常用的图像处理方法，代码详细，适合初学者(Source code, including the commonly used image processing method, the code in detail, suitable for beginners)

SAI图像插值算法 可插值uint8 uint16 图像(SAI image interpolation algorithm can interpolate uint8 uint16 image)

数字图像处理实验——直方图的均衡化，打开图像并实现其均衡化(Digital image processing experiments- histogram equalization, open the image and realize its equalization)

zemax非序列下gaussian光束的matlab程序（包括zemax演示源文件）(zemax sequence under non-gaussian beam matlab program (including zemax demo source files))

加权核范数最小化应用于图像处理的代码，很实用，且是图像处理领域很新的方法源码，所以该方法效果很好，希望对大家有用。(Nuclear weighted norm minimization codes used in image processing, it is useful, and it is a new image processing method for the source, so that this method works well, want to be useful.)

对图像的融合结果进行评价，有均值，标准偏差，熵，梯度，相关系数，光谱扭曲度(Image fusion results of the evaluation, there is the mean, standard deviation, entropy, gradient, correlation coefficient, spectral degree twist)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)

说明：  迭代收缩阈值算法和快速收缩阈值迭代算法求解Lasso问题(Iterative Shrinkage Thresholding Algorithm (ISTA) for LASSO problem)

基于ENVI和IDL的以HDF形式存储的已角度配准过后的遥感图像的BRDF计算，使用的核为li_transit和ross_thick。同时还有IDL基础教程和ENVI用户手册。(ENVI and IDL in the order based on HDF have been stored in the form of point of registration after the calculation of remote sensing images of the BRDF, the use of nuclear as li_transit and ross_thick. Along with IDL and ENVI user manual Essentials.)

本论文从CT图像重建原理入手, 根据迭代重建的物理意义, 从投影模型出发, 得到投影数据, 然后利用迭代算法MART 及SIRT 重建出断层图像, 再与模型相比较, 从而确定各算法的优劣, 总结出如何选择合适的图像重建算法。(Iterative Algorithms in Computed Tomographic Reconstruction)