Wavelet_SP

说明：  矩阵填充经典算法的代码，包含SET，SVT等(Matrix filling code of classical algorithm, including set, SVT, etc)

一个简单的HALCON计算圆心坐标的例子，C++代码格式，初学者适用！(A simple example of calculating coordinates HALCON, c++ code format, for beginners!)

说明：  聚类分析作业，可以对图像根据颜色进行聚类分析，通道数可以自我选择，方便使用。(Clustering analysis can cluster images according to color, and the number of channels can be self-selected for easy use.)

摄像头调用，并用摄像头拍照，再对照片进行处理(matlab Camera call)

彩色位图转黑白位图代码。何东健《数字图像处理》随书光盘提供的源码。(color bitmap to black-and-white bitmap code. Dong- Jian "Digital Image Processing" With the CD source.)

最佳拼接线方法进行图像拼接，对学习图像拼接很有用处(The best method of splicing line image mosaic, image stitching is useful for learning)

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

图像处理中边缘提取几种方法的matlab代码(many edge extraction codes about image processing)

该上传的256张CT图片是高质量的DICOME格式人类头骨的连续序列切片图，可直接用于医学三维重建或体绘制。(The upload of 256 CT images are of high quality DICOME form a continuous sequence of the human skull slice diagram can be directly used in medical 3D reconstruction or volume rendering.)

立体匹配，包括计算基本矩阵，极线校正，和SSD计算匹配点(Matching, including the calculation of fundamental matrix, epipolar correction, and SSD calculation of matching points)