picture3

这个代码可以获取一种颜色可以生成10进制的数，和一个16进制的数(the code can get a color can generate 10 to the 229 number, and a few of the 229 16)

信号处理的小波导引：稀疏方法（原书第3版） 《信号处理的小波导引：稀疏方法（原书第3版）》全面论述了稀疏表示的重要概念、技术和应用，反映了该主题在当今信号处理领域所起的关键作用。作者在解释了稀疏的主要概念后将其运用于信号压缩、噪声衰减和逆问题，同时给出了冗余字典、超分辨率和压缩感知中的稀疏表示。 　　本书既可以让应用数学系的学生了解数学公式的工程意义，也可以让计算机及电子工程系的学生了解工程问题的数学描述。对于小波理论与应用的研究人员，本书更是一本极具价值的参考书。(a Wavelet Tour of Signal Processing(Third Edition.The Sparse Way))

基于样本的纹理合成加速方法，MRF，基于Li-Yi Wei的论文。(Acceleration method based on texture synthesis samples, MRF, based on Li-Yi Wei of paper.)

此程序可以根据一幅图像的DEM读取一幅图像(This program can read an image of an image based on DEM)

基于PCL的估算散乱点云的法矢量，并进行颜色渲染显示(estimation of normal vectors for point clouds and color rendering display based on PCL)

说明：  图像检索的的基于语义的图像检索 纹理图像检索 图像的特征提取方法(Image Retrieval of semantic-based image retrieval image retrieval image texture feature extraction methods)

多类 kmeans 图像分割，基于灰度的图像分割。(Kmeans image segmentation, segmentation based on gray-scale images.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。(Enter a weighted undirected graph with vertices, edges, each of the side information (two vertices and weights), the establishment of the adjacency matrix structure, the output of the adjacency matrix. The above undirected graph adjacency matrix into adjacency list structure, the output of the adjacency list according to the adjacency table undirected graph depth-first traversal sequence and breadth-first traversal sequence, and outputs through the results using prim algorithm construct the weighted undirected graph minimum spanning tree, and the minimum spanning tree information on respective sides of the output.)

小球沿斜线运动,可以扩展到其他程序中，第一次上传，谢谢。(a ball along with a line.)

1.本程序功能包含显示直方图，OTSU的单值分割，OTSU的二值分割,OTSU的三值分割 2.在OTSU的分割时，通常情况下我们是通过类间方差得到一个分割阈值，但是有时候我们需要得到各灰度级别的目标，那么采取多值分割是 很必要的，通过改进得到OTSU的多值分割方法 3.本程序另外还有显示直方图，计算程序运行时间，处理结果以新的窗口显示等细节，这部分适合MFC初学者。(1. This procedure shows the histogram feature, OTSU single segmentation, OTSU binary segmentation, OTSU three segmentation 2. OTSU segmentation, it is usually the case we are through the between-cluster variance by a partition threshold , but sometimes we need to be the gray level of the target, then the multi-segmentation is necessary, through improved access to multi-OTSU segmentation methods 3. This procedure in addition to show the histogram to calculate run time, treatment the results of a new window display the details of this part of MFC for beginners.)