ransac_fitline_and_fitellipse

说明：  基于fft的数字图像处理MATLAB实现(Fft based on MATLAB for digital image processing to achieve)

利用低通滤波器对图像进行插值放大：按放大的倍数对原图像进行插零，插零后的图片与低通滤波函数进行卷积，原先插入的零的位置自动替换为适当的插值，如此图像就已经插值放大了，图像质量还不错。(Double the number of pixels of each row and column by adding a zero value pixel between each pixel of the image.Then operate with two kinds of low-pass filters to get the enlarged image.)

canny边缘检测的步骤： 1，生成高斯核，与图像做卷积 2，计算梯度图像 3，非极大值抑制 4，双阈值法和连接边缘(Canny edge detection steps: 1, Generate Gaussian kernel, convolution with the image 2, calculate the gradient image 3, non-maximal inhibition 4, double threshold method and connect the edge)

各个坐标系之间的坐标变化：地心大地坐标到地心空间大地直角系，地心系和测站系，测站系和测站系等之间的变化，旋转，平移。(Coordinate changes between the various coordinate systems: geocentric geodetic coordinate system to the geocentric Cartesian space earth, geocentric system and station lines, change the station, such as lines and lines between stations, rotation, translation)

彩色图像的威纳滤波去噪算法，很简单的，很全，自己毕业论文的程序(Color image of the Wiener filter denoising algorithm, very simple, very full, their thesis program)

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

说明：  解决散斑图像的重建问题,主要是使用了相位恢复算法(to study the picture problem)

此代码从局部上来使用直方图均衡来达到增强图像的目的，非常的好，而且已经调试好了无差错(This code from the local authorities to use histogram equalization to achieve the purpose of enhanced images, very good, and has good debugging error-free)

说明：  使用硬/软阈值算法，求解各种不同范数约束问题，算法主要有三种(Contains three matrix completion algorithms and a demo script for running them. Also compares against other matrix completion algorithms - Singular Value Thresholding and Fixed Point Iteration.)

图像增强的算法，但是有一定的局限性……但是对于一般比较典型的问题效果还是不错的……(Image enhancement algorithms, but there are some limitations ... but for a typical effect is good ...)