Kinect_DepthCanny

表面张力CSF模型，用于计算微重力条件下的两相流问题。(Comtinum Saface tension Force)

中值滤波，取出奇数个数据进行排序，用排序后的中值取代要处理的数据即可(median filtering.rar)

图像球面化，对于输入的图片进行球面变换达到图形变形的效果(Spherical image of, for input images to spherical transformation to achieve the effect of graph distortion)

生成avi视频截图序列。设置截图时长，截图频率，截图类型的参数。(Generate avi video sampling sequence.Screenshot duration, frequency and types of parameters are allowed to set freedom.)

* 说明: 该函数将对图象进行（成对函数匹配）操作。需要注意的是，此程序先要求对图像进行特征提取及形态学操作等，使其成为二值图像。(* Note: This function will be images (paired function matching) operation. Note that this procedure require image feature extraction and morphological operations, making it a binary image.)

This a very useful program from a book. It is mainly used for face-detecting.It also includes interface-program.

高斯平滑滤波实例，高斯滤波实质上是一种信号的滤波器，其用途是信号的平滑处理，我们知道数字图像用于后期应用，其噪声是最大的问题，，由于误差会累计传递等原因，很多图像处理教材会在很早的时候介绍Gauss滤波器，用于得到信噪比SNR较高的图像（反应真实信号）。 (Instance of the Gaussian smoothing filter, Gaussian filter is essentially a signal filter, its purpose is to smooth processing of the signal, we know that the digital image for the late application, the noise is the biggest problem, the error accumulated transfer reason, a lot of image processing textbooks will be introduced at an early Gauss filter for higher SNR of the image (real response signal).)

完成流程编码和huffman编码，适合做图像编码的熵编码，只要调整接口就好。(Complete the process encoding and huffman coding, image coding suitable for entropy coding, as long as the adjustment of the interface is like.)

将没有exif文件信息的裸RAW数据转换成YUV422格式的数据.(Exif file information will not be the bare RAW data into YUV422 format.)

输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用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.)