-
szmhclsf
这是一个数字模糊处理的算法论文!很好很经典(Number obfuscation algorithms! Good classic)
- 2012-05-27 14:56:19下载
- 积分：1
-
Retinex
本文实现了Retinex算法，支持对图像的去雾灯操作，是一种图像增强的方法。(this paper present a new image strength method-Retinex impliment by opencv)
- 2012-03-13 11:30:39下载
- 积分：1
-
Transfortion
计算机图形学中实现多边形平移，旋转，缩放变换。(Polygons in computer graphics to achieve translation, rotation, scaling transformation.)
- 2020-11-11 20:29:44下载
- 积分：1
-
opencv249SIFT
opencv SIFT源码详细分析，代码能够准确实现(opencv SIFT detailed analysis of the source code can achieve accurate)
- 2015-07-13 20:33:10下载
- 积分：1
-
vfxhw2
图像拼接源码实现，包括多频率图像融合，sift特征点配准算法(Image Stitching source implementation, including multi-frequency image fusion, sift feature points matching algorithm)
- 2010-03-16 14:22:04下载
- 积分：1
-
Image-color-VB-source-code
使用VB编写的图片反色源代码是图像处理的很好的教程(Image color VB source code)
- 2014-03-18 09:45:58下载
- 积分：1
-
XIHUA
本程序是使用c++开发语言编写的，功能是将bmp图像进行细化处理，比如，可以将比较粗的汉字细化成较细的汉字。(This program used c++ development language, the function is to thinning BMP image . For example, it can be more crude refining the Chinese characters into a fine characters.)
- 2016-01-06 16:35:17下载
- 积分：1
-
k_mean_uv
利用k—mean算法根据U、V进行聚类分块，最后完成图像分割，分割出得块用不同的灰度等级表示出来。(K-mean algorithm to cluster sub-blocks according to the U, V, to finalize the image segmentation, segmentation have blocks with different gray levels represented.)
- 2013-01-15 15:05:42下载
- 积分：1
-
DFT-DCT
说明： 基于VC++的图像的DFT变换和DCT变换，并可实现两者间的对比转换(VC++ based on the image of the DFT transform and DCT transform, and to achieve the contrast between the two conversion)
- 2021-02-15 10:09:48下载
- 积分：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
