-
Project_BFS
任务：用BFS或是DFS对图进行搜索，实现任何拓扑不连通的块的计算，算法要求写在CBFSSearch类中
工程名：Project_BFS
要求：对于生成的任意拓扑，求出其分枝个数，并输出每个分枝的节点
(Task: Using BFS or DFS for searching the graph to achieve any topology unconnected blocks calculation algorithm requires written in CBFSSearch class project name: Project_BFS Requirements: for generating arbitrary topology, find the number of its branches, and output node of each branch)
- 2013-08-21 17:03:04下载
- 积分：1
-
GA-FCM
遗传算法与FCM算法相结合实现图像分割，分割精度较好，速度较快(A combination of genetic algorithm and FCM algorithm to achieve image segmentation, segmentation accuracy is better, faster)
- 2012-06-05 09:06:01下载
- 积分：1
-
yudp
运动目标检测与跟踪，包括目标定位，匹配与跟踪!(moving target detection and tracking, including Target, matching and tracking!)
- 2020-06-26 05:20:01下载
- 积分：1
-
CPPvideoimageprocessing
利用Visual C++实现AVI文件的图像截取
实现对图像数据的读取显示
实现视频图像处理技术
编程中如何操作数据库中的图像字段
实现数字图像增强处理(Use Visual C++ AVI file image interception
To read the image data display
Video image processing technology
Programming how to operate the database image field
Digital image enhancement)
- 2014-04-21 11:17:34下载
- 积分：1
-
ImageProcessing
说明： 基于块分割的图像拼接，将图像按块拼接，缺点是速度很慢，算法有待改善(Block-based segmentation of the image mosaic, mosaic images by block, the disadvantage is very slow, the algorithm needs to be improved)
- 2011-03-24 18:22:01下载
- 积分：1
-
PP
基于SIFT+Kmeans+LDA的图片分类器的实现源码。
博文参考：http://www.cnblogs.com/freedomshe/archive/2012/04/24/2468747.html(The pictures classifier based on SIFT, Kmeans and LDA. Blog Reference: http://www.cnblogs.com/freedomshe/archive/2012/04/24/2468747.html)
- 2012-07-26 15:34:58下载
- 积分：1
-
RayTracer
VB像素光影跟踪（图像渲染）工具,有需要的就下载吧。(VB Tracking pixel lighting (image rendering) tools, there is a need to download it.)
- 2013-08-04 15:09:52下载
- 积分：1
-
display_video
对视频进行基本的处理，例如载入视频，显示视频，控制播放(Basic video processing, such as loading the video, show video, control playback)
- 2011-08-28 16:14:12下载
- 积分：1
-
DE
说明：
最简单的差分格式有向前、向后和中心3种。
向前差分：f (n)=f(n+1)-f(n)
向后差分：f (n)=f(n)-f(n-1)
中心差分：f (n)=[f(n+1)-f(n-1)]/2(The easiest difference format forward, backward, and three kinds of centers.
Forward differencing: f (n) = f (n+ 1)-f (n)
Backward difference: f (n) = f (n)-f (n-1)
Central difference: f (n) = [f (n+ 1)-f (n-1)]/2)
- 2016-05-17 21:08:01下载
- 积分：1
-
RanSacCode
该代码用于对错误匹配点进行过滤操作，即去除错误的匹配点(The code is used to remove the wrong match points,and make sure the right matching.)
- 2014-12-31 11:17:07下载
- 积分：1
