-
CEGUIDemo3
介绍CEGUI中所给的例子的的文档，很详细.(Introduce the samples in the CECUI,very detailed!)
- 2009-05-19 15:07:56下载
- 积分：1
-
jm5.0c
视频编解码技术，在有限带宽的情况下，能够大幅度的压缩编码比特数，图像的质量没有丝毫的下降。(Video codec technology, in the case of limited bandwidth can be substantial coding bits, the image quality is not the slightest decline.)
- 2010-08-23 13:34:24下载
- 积分：1
-
深度图像的快速实现增强的算法 GUIDED
深度图像的快速实现增强的算法，效果非常好，但是速度很快(Quick to realize the depth of image enhancement algorithms, the effect is very good, but fast)
- 2015-04-17 11:22:58下载
- 积分：1
-
YUV_DCT
YUV Quantization using VS2010
- 2013-07-14 19:12:13下载
- 积分：1
-
demo
北航图像处理demo，目前集成了从色彩转换、彩色图像处理、灰度图像处理、二值图像处理、阈值分割、边缘检测、数学形态学方法、等多个组件(Northern image processing demo, now integrated from the color conversion, color image processing, gray-scale image processing, binary image processing, thresholding, edge detection, mathematical morphology, and many other components)
- 2014-05-21 19:46:11下载
- 积分：1
-
DIBDisplay
这些代码是有关数字图像处理的一些算法，大家有需要的，可以在里面找些与自己相关的(These codes are some of the digital image processing algorithms, we need, in which you can find some with their associated)
- 2013-07-12 17:55:23下载
- 积分：1
-
cviimage
cvi图像设计替换背景 扣图专用代码 毕业设计可用(cvi replace the background of graphic design graduate design buckle Figure specific code available)
- 2020-07-01 15:00:01下载
- 积分：1
-
SiftSearch
基于Sift算法开发商标图案匹配程序，(1)各个CBIR模块及其技术；
(2)Sift算法及其在图像匹配、目标识别中的应用；
(3)Sift算法在图像检索中的应用。
(Sift algorithm development based on pattern matching program mark (1) Each CBIR module and its technology (2) Sift algorithm and its application in image matching, object recognition application (3) Sift algorithm in image retrieval applications.)
- 2009-09-28 12:03:28下载
- 积分：1
-
Digital_image_processing_frequency_domain
该数字图像处理文件有很强的修改能力，可以仔细的分析每一个频域不同条件下的实验结果分析。有很强的处理图像能力(The digital image processing of documents has a strong ability to change and be more careful analysis of each under different conditions, a frequency-domain analysis of the experimental results. Has a strong ability to deal with images)
- 2010-01-03 16:37:44下载
- 积分：1
-
Graph
输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用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.)
- 2020-12-13 15:29:15下载
- 积分：1
