搜索资源列表
F.changLabeling
- F. chang Labeling algorithm(a treatise)
cppbgfg_gaussmix2
- 背景建模方法之高斯混合模型,使用到MOG2。算法快,并且可以进行阴影检测。遍历性:对每一个像素进行建模。作者为Z.Zivkovic-The algorithm similar to the standard Stauffer&Grimson algorithm with additional selection of the number of the Gaussian components based on: "Recursive unsupervised learning of fini
myWatershed
- 参考文献:Meyer, F. Color Image Segmentation, ICIP92, 1992 代码原型:OpenCV2.4.3——>void cvWatershed(const CvArr* image, CvArr* markers)-References: Meyer, F. Color Image Segmentation, ICIP92 1992 code prototype: OpenCV2.4.3-->gt void cvWatershed (co
subpixelMatching
- 用于双目立体图像校正:亚像素角点、双向粗略匹配、用RANSAC方法计算F、opencv自带函数矫正图像-For binocular stereo image correction: the corner points of the sub-pixel, two-way rough match, use the RANSAC method F comes with opencv function corrected image
YUV420Player
- YUV420播放器很好用,是个支持VC++播放的的视屏工具-YUV_PLAYER adad dadasd g fg f cv x v d fe x vd f sd fs f
MTF
- Kal man 滤波是一种应用非常广泛的状态估计算法 基于信息融合的 Kal man 滤波包 括状态向量融合和测量融合两种方法 传统的 Kal man 方法 TTF 具有较低的估计误差和很长的计算时间 提出的状态向量和测量向量的融合模型 MTF 利用局部融合信息给出一种更好的状态估计 计算时间短 性能也比 TTF 高-Conventi onal Kal man filt er TTF based on i nf or mati on f usi on i ncl udes t Wo
Projects
- 帧差法,开运算,闭运算,二值化,灰度值变换,opencv3.0开发,vs2012-Zhèng chà fǎ, kāi yùnsuàn, bì yùnsuàn, èr zhí huà, huī dù zhí biànhuàn,opencv3.0 Kāifā,vs2010 Frame difference, opening operation, closing operation, binary, gray-value conversion, opencv3.0 development, vs2
canny_test
- Canny边缘检测算法是1986年有John F. Canny开发出来一种基于图像梯度计算的边缘 检测算法,同时Canny本人对计算图像边缘提取学科的发展也是做出了很多的贡献。尽 管至今已经许多年过去,但是该算法仍然是图像边缘检测方法经典算法之一。-Canny edge detection algorithm in 1986 John F. Canny edge detection algorithm developed by the image gradient calcu
茶叶茶艺茶道茶文化PPT模板
- 这是双人竞走游戏,它是一个双人玩的策略游戏,游戏有两点,第一个游戏者可以按R,G,f,D控制第一个点的走向,(This is a double race walking game. It's a two person game strategy game. There are two points in the game. The first player can control the trend of the first point according to R, G, F and D.)