optimize_c

图片处理 去噪音，去模糊为了实现较好保留图像边缘特征的有效去噪,提出了一种基于边缘检测的Contourlet 变换去噪方法(Picture Deal)

运用openCV编写的C++图像色彩转移程序，原理是先转化到Lab图像，再保持L不变调整图像的a、b分量的均值跟方差。(Using openCV prepared C++ image color transfer process, the principle is first converted to Lab image, and then adjust the image to keep L constant a, b, with the mean variance component.)

目标物与摄像机距离已知的情况下，计算白天大气能见度距离。(The distance between the object and the camera is known to calculate the visibility distance in daytime.)

实现BMP文件的基本功能。用C++实现一个Class，该Class具有读写BMP文件功能；该Class还具有对图像像素进行操作的功能（针对每个像素的读、写） (BMP files to achieve the basic functions. Using C++ implementation of a Class, the Class has read and write BMP file functions the Class also features the image pixel operation function (for each pixel of the read, write))

C语言数学形态学的腐蚀运算，同时适用于二值图像与灰度图像。(C language mathematical morphology erosion operation also apply to binary images and gray-scale image.)

基于VisualC_和DCMTK的医学DICOM图像显示与调窗,同时在MFC 下完成鼠标拖动进行窗宽/窗位的调节(Medical image of DICOM VisualC_ and DCMTK display and window based on, at the same time in MFC complete the mouse to drag the window width/window regulator )

图像去雾c++版源代码，实现效果还不错，可直接运行。(Fog to remove the c++ version of the source code, the effect is not bad, can be run directly.)

基于遗传模拟退火和Otsu法的图像分割。采用一种基于模拟退火算法(SA)的混合遗传算法(GASA),来进行Otsu方法选择阈值，其中进行求解时是非线性的遗传算法（GA）的应用优化了求阈值过程，并尽可能地减少其运算量,而加入SA则避免了遗传算法(GA)常见的早熟收敛现象,从而实现有效简单的图像分割。 (adopt hybrid genetic algorithm(GASA) based on simulated annealing algorithm,choose threshold by Ostu method,which applicated the non-linear genetic algorithm(GA) allows us to optimize the process of threshold. And, where possible, to reduce the computation. in order to achieve effectivly and simply image segmentation. Combination SA is to avoid the common phenomenon about premature convergence in genetic algorithm (GA) to achieve a simple and effective image segmentation.)

说明：  SIFT算法的区域匹配，比原有的SIFT+KD树匹配更加高效、准确。(different area SIFT algorithm which is better than the original SIFT and KD tree match.)

任务：用BFS或是DFS对图进行搜索，实现任何拓扑不连通的块的计算，算法要求写在CBFSSearch类中 工程名：Project_BFS 要求：对于生成的任意拓扑，求出其分枝个数，并输出每个分枝的节点 (Task: Using BFS or DFS for searching the graph to achieve any topology unconnected blocks calculation algorithm requires written in CBFSSearch class project name: Project_BFS Requirements: for generating arbitrary topology, find the number of its branches, and output node of each branch)