LBP

Matlab遥感道路提取之Hough检测(Matlab to extract the Hough detect remote road)

傅里叶描述子，具有平移，旋转不变性，适合目标识别(Fourier descriptors, translation, rotation invariance, for target recognition )

实现肺实质初始分割及采用滚球法（形态学开运算）进行修补肺实质轮廓凹陷。(Achieve initial segmentation and the use of the pulmonary parenchyma ball method (morphological opening operation) to repair the lung parenchyma contour depression.)

基于Matlab实现的傅立叶梅林变换的源程序代码(Based on Matlab implementation of the Fourier transform of the source code Merlin)

matlab 中的视频图像处理。可用的程序()

一些阈值图像分割算法：迭代法；局部阈值；otsu；最大熵法等 (Some threshold image segmentation algorithm: the iterative method local threshold otsu maximum entropy method)

现有自然图像素描画效果生成算法存在容易造成画面细节丢失，笔画线条单一等问题。针对这些问题，本文提出了一种改进的自然图像素描画效果生成算法，通过模拟艺术家创作素描画过程，分步生成素描画图像底纹和素描画场景笔画轮廓，采用8个方向卷积滤波提取图像中不同方向的细节信息，并使用不同长度不同粗细的笔画来模拟艺术家在创作过程中不同力度的绘画效果，最后合并素描画笔画效果和素描画图像底纹，得到与原输入自然图像内容一致，色调与艺术家绘制的素描画效果相同，笔画和底纹形式与实际素描画相似，真实感较强的素描画效果输出图像。大量实验结果表明本文方法可以生成高质量的自然图像素描画效果，与现有成熟的铅笔画生成技术相笔，本文方法具有较强的可比性。(The existing algorithms for natural image sketch production are easy to cause some problems such as the loss of image details, singleness of the stroke line. To solve these problems, this paper proposes an improved algorithm for the natural image sketch effect producing. By simulating the artist creation process of sketch, step-by-step generate image shading sketch image shading and drawing the scene outline stroke of the sketch image, using 8 directions of convolution filter to extract the details of different directions in the image, furthermore, using the stroke of different length and thickness to simulate the painting effect of different strength in the process of artist creation, finally we merge the sketch stroke effect and sketch image background to get the output image, which have consistent content with the original input image, have the same tonal effect with artists draw sketch, have the similar Stroke and background form with the actual sketch and have strong real sense in)

图着色问题（Graph Coloring Problem, GCP）又称着色问题，是最著名的NP-完全问题之一。路线着色问题是图论中最著名的猜想之一。(Graph coloring problem (Graph Coloring Problem, GCP), also known as coloring problem, is the most famous NP-complete problems. Line graph coloring problem is one of the most famous conjecture.)

说明：  信号处理傅里叶变换，三分之一倍频程，荷载时程曲线绘制(Signal processing Fourier transform, one third octave, load time history curve drawing)

基于物体灰度图像的物体三维形状恢复，修改图形路径和光源方向即可(Based on the three-dimensional shape of the object to restore the object grayscale image, modify the graphics path and direction of the light source can be)