sarImagingSimu

简易二值化演示易语言源码，例程程序使用嵌套循环改变画板颜色演示了图像二值化的简单过程。(Simple binary demonstrate easy language source code , a routine procedure uses nested loop Sketchpad color change demonstrates the binary image of a simple process .)

说明：  SMD,Brenner,Robert,EOG,Sobel算子图像清晰度计算(SMD,Brenner,Robert,EOG,Sobel,evaluation function)

基于扩展卡尔曼滤波器的粒子滤波器源程序The iterated extended kalman particle filter(based on extended Kalman Filter The particle filter iterated extend source ed Tracking particle filter)

基于除法模型的鱼眼图像校正代码，包含摄像机内参和畸变参数在内的5个参数，无需进行填补空洞的操作。(Based fisheye image correction code division model, including internal camera and distortion parameters, including five parameters, without the need for filling voids operation.)

基于otsu的自适应阀值canny边缘检测(adaptive canny edge detection based on otsu)

1、可制作圆形、椭圆形、菱形、方形、三角形印章。 2、支持多种特效：翻转图形、透明处理、高斯模糊、亮度/对比度/饱和度/锐化/反相/海绵/陨化(磨砂)/浮雕等等。 3、可将制作好的印章保存至印章库。 4、支持1％－1000％比例缩放。 5、支持导出印章图片(透明图章使用GIF格式)。 6、支持预览/打印。(1, can be made round, oval, diamond, square, triangular seal. 2, supports a wide range of effects: flip graphics, transparent deal, Gaussian blur, brightness/contrast/Saturation/Sharpness/RP/sponge/meteorite of (Matte)/relief and so on. 3, can be saved to create a good seal of the Treasury seal. 4, in support of 1-1000 scaling. 5, support for export seal picture (stamp the use of transparent GIF format). 6, support for preview/print.)

说明：  四叉树程序，图像处理，要做这个的可以看看(Quadtree procedures, image processing, that can do this look)

这是我编写的数学形态学处理灰度图像和二值图像的源代码，没有使用matlab自带的函数。可以实现膨胀、腐蚀以及开闭运算。(This is written in mathematical morphology of grayscale images and the source code of the binary image, do not use Matlab comes with function. Can achieve expansion, corrosion, and the opening and closing operation.)

图像420转换为422或444的算法。高斯加噪算法，脉冲加噪算法。(YCbCr 4:2:0 image is converted to 4:2:2 or 4:4:4 of the algorithm, Matlab program is)

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