LaplacianPyramid

图着色问题（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.)

ICA用于图像特征提取 通过定义一个衡量分量独立性和非高斯性的目标函数来实现的(ICA for image feature extraction components by defining a measure of independence and non-Gaussian nature of the objective function to be achieved)

基于噪声自适应模糊选择滤波器的椒盐噪声抑制处理((NAFSM)Noise Adaptive Fuzzy Switching Median Filter for Salt-and-Pepper Noise Reduction(SPletter10))

说明：  交互式支持向量机图像分割程序，通过鼠标选取区域实现前景和背景选取(Interactive support vector machine image segmentation procedures, through the mouse to select regions of foreground and background selection)

用于图像处理的压缩感知的快速贝叶斯匹配追击算法(Compressed sensing image processing for rapid Bayesian matching pursuit algorithm)

本程序为基于快速双边滤波器的边缘保持算法，算法具有平移不变性，具有线性复杂度(this is a edge-preserving denoising method using fast bilateral filter)

程序可以实现BMP图片特效处理,包括浮雕效果(bmp picture)

说明：  用水平集方法进行细胞图像的分割大家可以看看写的有点简单(level set method using cell image segmentation we can see a little bit simpler to write)

说明：  独立分量分析，快速独立分量分析，FAST-ICA可以用(Independent component analysis)

人脸检测和特征点定位源码，2014CVPR(face detect and the landmark detect)