RLE

完成车道线检测，且运行效率高，附带图片测试(it has a high performance over lane detection, and leave pictures for testing)

快速非局部均值，用来消除噪声，效果良好，适合于细节较多的图像(Fast nonlocal means is used to eliminate noise and achieve good results, which is suitable for more detailed images.)

“一种用于夜间图像增强的算法”包括原文和程序实现并附有图像。其中‘ye’图效果最好。(A method for the night image enhancement algorithm, including the original and the program along with the image. Figure‘ye’the best.)

B样条曲面方法，通过b样条曲面的拟合得到图像的背景，减去背景图像就能得到重要内容的图像，除去了背景对图像内容的干扰，也可解决光照不均的问题(algorithms for cytoplasm segmentation of fluorescence labelled cells)

　　本函数选用阈值分割的方法来完成瞳孔定位。根据图像的灰度分布特性，瞳孔部分的灰度值最小，其次为虹膜部分，最大的为巩膜部分。因此在灰度直方图中，第一个大峰值的邻域即是瞳孔所在区域。(Function selects the threshold segmentation method to accomplish the pupil location. Based on image gray distribution features, the pupil part of the grey value of the minimum, followed by the iris part, the biggest part of sclera. So in gray level histogram, the peak value of the first big neighborhood is the pupil area.)

说明：  基于cs的sar成像仿真，包括omp、sl0、osl0、onsl0等cs算法(ISAR imaging simulation based on CS, including OMP, sl0, osl0, onsl0 and other CS algorithms)

第二代小波变换，基于提升格式的整数小波实现数字图像的无损压缩编码(Second-generation wavelet transform, lifting scheme based on integer wavelet realize the lossless compression of digital image coding)

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

佳能数码相机图像处理源码工具(EOS 350D, 20D, 1D等)(Canon digital camera image processing source tools (EOS 350D, 20D, 1D, etc.))

对文字笔画特征进行提取，可以对图像中的文本区域进行定位。(Stroke extraction of text features, you can image in the text area to locate.)