DRR_registration

说明：  本代码采用的是opencv，有视频采集和对采集的视频帧进行laplace处理的功能！(This code uses a opencv, with video capture and the capture of video frames laplace processing capabilities!)

基于规格化Hough变换的天波超视距雷达检测前跟踪算法(Hough transform based on the normalized horizon radar detection and tracking algorithms)

图像处理中的边缘检测以及曲线拟合的结合应用，实现边缘连接和线段拟合源码(image processing edge detection and curve fitting combination of applications, connectivity and edge line fitting FOSS)

RINGSDK包含界面库和图象库,我编译过，可以使用(RINGSDK is a interface lib )

说明：  用canny算子来检测图像边缘，VC++(Using canny operator to detect image edge)

本系统中VIS欠缺的SIFT_VC.lib文件。。。 http://www.pudn.com/downloads224/sourcecode/math/detail1055031.html(This is lib file, which is used in Video Intelligent System (VIS) based on the Microsoft Visual Studio 2008 compiler environment and OpenCV 2.0 library. It includes foreground detection, motion object detection, motion object tracking, trajectories generation and analysis modules. It realizes a friendly interface based on dialog, which provides a convenient example for new learners. keywords: opencv, mixture of gaussian model, sift feature and ransac method, mean shift, particle filter, kalman filter, object detection and tracking, video intelligent system.)

说明：  基于块分割的图像拼接，将图像按块拼接，缺点是速度很慢，算法有待改善(Block-based segmentation of the image mosaic, mosaic images by block, the disadvantage is very slow, the algorithm needs to be improved)

cvi图像设计替换背景 扣图专用代码 毕业设计可用(cvi replace the background of graphic design graduate design buckle Figure specific code available)

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

这是一个扫描线种子填充算法的程序，这个程序的演示效果不错(This is a scan line seed fill algorithm program, this program demonstrates good results)