A2FactSheet

说明：  采用通道差的引导滤波进行大气光估计和明暗通道混合的夜间去雾(The guiding filter of channel difference is used for atmospheric light estimation and night defogging with mixed light and dark channels)

三边滤波器，能够实现平滑滤波的同时进行边缘保持。同时对脉冲噪声有优良的滤波效果。(trialateral filter)

缺陷检测，顶帽变换，底帽变换，halcon，可以直接使用(Defect detection, top hat transformation, and bottom cap transform, Halcon, can be used directly)

System Generator中伪彩色增强建模(Pseudocolor enhancement model in the System Generator)

jpeg压缩代码 An example for jpeg compression and the restoration。(The attached utility is a work I ve submitted to the university. It shows what a jpeg compression is all about.)

说明：  数学形态学对信号进行去噪，效果较好，信号扰动特征得到很好保留(Mathematical morphology to signal de-noising effect is better to be a good signal to retain the characteristics of disturbance)

这是一个非常经典的特征提取算法，matlab写的2DPCA源码(This is a very classical feature extraction algorithm 2DPCA, matlab source code)

数字图像抠图源代码,是由一个外国人写的，非常好用，我希望能和大家一起分享(digital image matting matlab code written by a foreigner,it is very useful and I would like to share with everyone)

基于matlab的图像分解重构的源码，基于matlab的图像分解重构的源码。。。(The reconstruction of the image decomposition based on matlab source code, the reconstruction of the image decomposition based on the matlab source code..)

绣花问题是连续型的填充，在不同区域的缝制过程中，缝针不能提针，因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法：先对轮廓走向进行 定义，通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割，采用交点的特征值比较彻底的解 决了分割时的重点问题，将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”，通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历（缝制）序列和每 个节点的缝制方向，最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(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)