top-hat

说明：  基于matlab的傅里叶光学仿真教程和光学原理讲解，有很多实用代码(matlab tutorial for fourier optics, containing simulation codes and basic theory)

matlab图像处理代码，利用算法对点云数据进行直方图以及标准差统计，含M文件和GUI(matlab image processing code, the use of algorithms for point cloud data, histograms and standard deviation statistics, including documentation and GUI M)

把一幅图像进行经验模式分解，结果为不同频率分量的IMF，用于希尔伯特黄变换，图像去噪等(empirical mode decomposition)

该代码是对图像进行二值化处理，进行图像分割(The code is to binarize the image, the image segmentation)

is very good,i think you will be liake it

一个车牌定位方法，包括图像的灰度化，二值化，数学形态学的处理，滤波等(A license plate location methods, including gray-scale images, the binarization, mathematical morphology processing, filtering, etc.)

最小二乘匹配，图像匹配算法，需要初始匹配坐标，可以达到亚像素精度(least squares matching, image matching algorithm, the initial need to match coordinates, can reach sub-pixel accuracy)

Jianchao Yang 的基于稀疏表示的单幅图像重建的原始代码，先将高低训练图像分块，再将块训练成高低字典，将测试图像映射到低字典上，得到系数，再乘以高子典就得到最后的图像。对学习超分辨率同学的参考作用很大。(This is the original matlab code for super resolution by Jianchao Yang 。The method is sparse represent based on the overcomplete dictionary。)

【高斯核函数改进 参考价值1】LBF活动轮廓模型的改进.pdf【高斯核函数的改进 参考价值5】单核和多核相关向量机的比较研究.pdf([Gaussian kernel improved reference value 1] .pdf LBF improved active contour models comparative study [.pdf Gaussian kernel improvements reference 5] single and multi-core related vector machine)

一个集成的图形界面的程序，可调用每一次作业子程序。 一、调用画点的函数，用DDA、中点算法画直线和中点算法画圆和椭圆。 二、多边形扫描转换算法和区域填充算法实现（扫描线算法为必做，基于求余运算的边缘填充和边标志算法为任选；基于种子的区域填充采用4连通区域的递归种子填充算法，或扫描线种子填充算法，要求种子点(x,y)可交互输入）。 三、线段裁剪和多边形裁剪算法的动画演示实现。（两种线段裁剪算法和H-S多边形逐边裁剪算法）多边形裁剪算法的动画演示要求先画出一个封闭的多边形，再画矩形的裁剪窗口，然后选择裁剪按钮（或命令），按下“上边裁剪”按钮（或执行“上边裁剪”命令），多边形相对裁剪窗口的上边进行裁剪，显示上边裁剪后的多边形，依此进行其它各边裁剪。 四、用动画实现二维图形变换的各种算法，实现对指定形体的平移、旋转和缩放。（包括类似自行车行走和绕固定点旋转的自旋转物体动画。） 五、简单三维图形系统：凸多面体的建模、透视投影，隐藏面的消除及基本图形变换（平移、旋转、缩放）。 六、交互式Bezier曲线的输入绘制程序实现 (An integrated graphical interface of the program, each operation subroutine callable. One call a function of the point of the painting, with the DDA, the midpoint algorithm for drawing a straight line and the midpoint algorithm circle and oval. Second, the polygon scan conversion algorithm and region filling algorithm (scan line algorithm for must fill and edge flag algorithm based on the edge of the modulo operator is optional using the 4 regional connectivity recursive seed filling algorithm based on the area of seed filling, or scan line seed filling algorithm requires the seed point (x, y) can be entered interactively). Line Clipping polygon clipping algorithm animation achieved. (Two Line Clipping Algorithm and HS polygon-by-side clipping algorithm) polygon clipping algorithm animation requires draw a closed polygon, rectangle and then draw the crop window, and then select the the cropped button (or command), press the "on top of cutting "button (or the implementation of)