-
BGS
说明: 基于各种算法的运动视频背景消除。使用opencv工具库,通过读取视频文件,处理视频,最后存储。(Background Subtract Algorithm)
- 2010-04-20 10:37:13下载
- 积分:1
-
DIPSimulator
图像DFT,C语言编写的代码,附带几个另外的处理,(Image DFT, C language code, with some additional processing,)
- 2011-10-10 15:31:46下载
- 积分:1
-
raw2bmp
读取RAW格式文件,将其转换为BMP格式文件并存储,主要实现灰度图像的转换(Read the RAW format, convert it to BMP format file and stored, mainly to achieve the conversion of grayscale images)
- 2011-11-08 10:36:16下载
- 积分: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)
- 2021-01-09 18:38:50下载
- 积分: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
-
Fourier
实现了读取一个bmp图片的傅里叶变换 使用C语言实现 读取一个 24位 图 转换为8位灰度图后,进行傅里叶变换处理(二维) 采用快速傅里叶变换——蝶形算法 北航图像处理作业~需要进一步交流 请联系qq 422563357(Reads a bmp image to achieve a Fourier transform using C language Northern image processing operations)
- 2020-10-27 21:20:03下载
- 积分:1
-
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
-
DIC
通过数字图像相关的方法计算两幅图像之间的位移,计算时间较长,是最基础的DIC,没有优化。(Digital image correlation method to calculate the displacement between the two images, the time is longer, is the most basic DIC, no optimization.)
- 2021-03-31 10:59:09下载
- 积分: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
-
IFC读写代码
说明: IFC文件格式读取和写出源码,目前该源码是1.0版本(IFC file format reads and writes the source code, which is currently version 1.0)
- 2020-09-16 14:17:55下载
- 积分:1