SSD%2BSAD%2BNCC算法

小波分解，db4小波分解，分解为4层，可以直接运行(Wavelet decomposition, db4 wavelet decomposition, decomposition level of three layers, can be directly run)

该源码为目标检测和跟踪算法 包括： 1. 静态背景下的背景预测法目标检测 2. 静态背景下帧间差分法目标检测 3. Mean Shift目标跟踪方法 4. 重心多目标跟踪方法 (The source code for target detection and tracking algorithm include: 1 Static background background prediction target detection 2 Static background frame difference method for target detection 3. Mean Shift tracking method 4 multi-target tracking methods focus)

操作简单，实现双目视觉下的三维重建，输入双目下两张图片，生成渲染后的重建结果。(Simple, to achieve a three-dimensional reconstruction under binocular vision, binocular enter under two pictures, generated reconstructions rendered.)

基于模糊贴近度的SAR图像变化检测，包括算法流程及具体代码(Based on the fuzzy nearness of the SAR image change detection, including the algorithm process and the specific code)

对理想的心音信号加入噪声，仿真成实际带噪声的心音信号，然后对其进行维纳滤波程序(The ideal heart sound signal added noise, simulation into actual heart sounds with noise signal, and then its Wiener filtering program)

实现图像的几何变换，用控制栅格的方法来将一幅变形的图片恢复原型(Image geometric transformation, with control of the grid method to deformation of an image to restore the prototype)

迭代CT重建血管，希望对大家能够有所帮助(Iterative CT reconstruction of blood vessels, we want to be able to help)

著名专家写的计算机视觉方面的原著，希望对大家有所帮助(Writing a well-known experts in the computer vision aspects of the original, and they hope to help everyone)

图像分割是图像分析的关键步骤，而水平集方法是图像分割的一项热门方法，它有着许多算法不具有的优点，尤其可用于分割背景复杂信息难以提取的医学图像。这里是一些水平集分割图像的matlab的实现例子，希望可以帮到大家。(Image segmentation is the key step of image analysis, while the level set method is a popular image segmentation method, it has many advantages that the algorithm does not have, especially can be used for medical image segmentation of complex background information is difficult to extract. Here is some level set segmentation image matlab example, I hope we can help you.)

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