▍1. CBCT
FDK重建算法 希望对其他人能有帮助 用C和cuda 实现的(fdk reconstrcution algorithm using cuda and c source code hope to help others it may be usefull. it is implented by c and cuda)
FDK重建算法 希望对其他人能有帮助 用C和cuda 实现的(fdk reconstrcution algorithm using cuda and c source code hope to help others it may be usefull. it is implented by c and cuda)
基于VC++的RGB-IHS 变换实现过程和主成分分析 PCA 实现过程 .(The implementation process based on VC++ RGB-the IHS transform and principal component analysis PCA implementation process.)
改进的聚类光流法,聚类方法有kmeans和DBSCAN,光流法金字塔LK可以用,HS光流法占用内存太多。(Improved clustering optical flow method, clustering method kmeans and DBSCAN, pyramid LK optical flow method can be used, HS optical flow occupy too much memory.)
lbg算法是一种经典的矢量量化算法,此源码为lbg算法的c语言实现。(lbg algorithm is a classic vector quantization algorithm, the algorithm lbg source for the C Language.)
一套基于VC++的遥感影象处理系统,可以实现空间域,频率域以及光谱的处理(yi tao ji yu VC++ de yaohan yingxiang chuli xitong)
以SIFT特征为目标输入,LDAHash方法进行降维实现目标识别(SIFT features input LDAHash method to reduce the dimensionality of the target recognition)
光线跟踪,计算机图形学的实验,实现的是消隐,光线之间的遮挡等(Ray-tracing, computer graphics experiments, realize that the hidden light, such as between the block)
这是典型的图像分割Livewire算法的源码 结合OPENCV,配置一下就可以用了(This is a typical source image segmentation algorithm Livewire combination OPENCV, can be used to configure what)
这是用C++实现图像立体匹配的一个完整的论文代码,主要特性是提出了一种全新的跨规模代价聚合方法,适合对于图像的立体匹配有一定基础的人学习(Cross-Scale Cost Aggregation for Stereo Matching)
包括图像输入(打开文件、采集、捕捉图像、从剪贴板粘贴、打开扫描软件、灰度化、添加随机噪声、椒盐噪声、去噪声)、图像处理(几何变换、灰度反转、直方图均衡化、直方图统计、图像复原、边缘提取、伪彩色、二值化、图像变换)、图像输出(另存图像、打印输出、复制到剪贴板)(Including image input (open the file, capture, capture images, paste from the clipboard, open the scanning software, graying, adding random noise, Salt and pepper noise, to noise), image processing (geometric transformation, gray inversion, histogram equalization oriented, histogram statistics, image restoration, edge extraction, pseudo-color, binary, image transform), image output (save the image, print out, copy to clipboard))
图像处理软件,功能齐全,简单,而且逻辑清除,很适合图像处理编程初学者(Image processing software, full-featured, simple, clear and logical, it is suitable for image processing programming beginners)
M估计子,计算机视觉大牛Peter Meer出品。(Generalized Projection based M-estimator C++ code to find the robust estimate derived without using any user supplied scale. The theory is described in Generalized Projection Based M-stimator. )
采用MFC,实现遥感图像的基本增强,滤波,变换等功能。还可以保存数据。(Using MFC, to achieve the basic enhancement of remote sensing images, filtering, transformation and other functions. You can also save data)
生成四副条纹图,进行四步相移,并且进行相位解包裹,并以图片形式输出结果(Generate four fringes, were four-step phase shift and phase unwrapping, and output as a picture)
视觉测量中编码点与非编码点的匹配的方法实现(Vision measuring, coding point and the coding point matching )
经典的斑块分析算法,计算Blob的源码,算法很好。(Classical plaque analysis algorithms to calculate Blob source code, algorithms very well.)
可以在VTK下进行三维重建的DICOM数据(Three-dimensional reconstruction can be carried out in the VTK DICOM data)
将传统的串行均值滤波算法修改为基于CUDA的并行的滤波算法(Modify traditional serial mean filtering algorithm based on CUDA parallel filtering algorithm)
输入一个带权无向图的顶点数、边数、各条边信息(两个顶点和权值),建立该图的邻接矩阵结构,输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构,输出该邻接表;根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列,并输出遍历结果;用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.)
输入一个带权无向图的顶点数、边数、各条边信息(两个顶点和权值),建立该图的邻接矩阵结构,输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构,输出该邻接表;根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列,并输出遍历结果;用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.)