登录
首页 » Visual C++ » Kinect_DepthCanny

Kinect_DepthCanny

于 2014-02-21 发布 文件大小:4898KB
0 123
下载积分: 1 下载次数: 4

代码说明:

  用kinect获取3D图像,并从3D图像中用OpenCV方法从深度图中获取梯度边缘,从而得到更多信息,做后续处理(Get with kinect 3D images, and get the edge gradient from the depth map from a 3D image using OpenCV method to obtain more information, do follow-up treatment)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 多目标跟踪的JPDA算法
    用来进行多目标跟踪的JPDA算法的的MATLAB程序包. 跟踪效果还行. (Used for multi-target tracking JPDA algorithm of the MATLAB package tracking performance is okay.)
    2021-04-22 15:38:48下载
    积分:1
  • Smooth
    对图像进行平滑处理,像各种滤波的方法,如均值滤波法、中值滤波法(Smoothing the image, like the various filtering methods, such as mean filtering, median filtering method)
    2010-07-16 13:17:31下载
    积分:1
  • ImageMatch
    摄影测量中影像匹配小程序,附带两幅图片,比较实用(Photogrammetry image matching small program, with two pictures, more practical)
    2016-04-29 20:03:43下载
    积分:1
  • surfAndsift
    里面有注释,还有sift和surf的比较(There are notes, there are more sift and surf the)
    2015-01-25 21:16:46下载
    积分:1
  • MRF2.2
    MRF代码实现,visual C++ 代码,不错,可以尝试(an implementation of MRF)
    2021-03-11 15:09:26下载
    积分:1
  • CodeofOpenCV
    《OpenCV基础教程》于仕琪主编,书中所有源代码下载,基于OpenCV的图像处理技术(" OpenCV-based tutorial," in Shi Qi editor of the book to download all the source code, based on OpenCV image processing technology)
    2009-12-24 15:35:12下载
    积分:1
  • Kinect_DepthCanny
    用kinect获取3D图像,并从3D图像中用OpenCV方法从深度图中获取梯度边缘,从而得到更多信息,做后续处理(Get with kinect 3D images, and get the edge gradient from the depth map from a 3D image using OpenCV method to obtain more information, do follow-up treatment)
    2014-02-21 21:19:53下载
    积分:1
  • Tracking
    使用VC++ 6.0 和 OpenCv实现粒子滤波目标跟踪算法,主要功能在MFC对话框内实现。(particle filter object tracking)
    2011-08-21 22:30:52下载
    积分:1
  • glint
    此程序为计算雷达目标特性角闪烁特性的函数代码(computing the anglar glint)
    2020-09-28 08:47: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
  • 696518资源总数
  • 104349会员总数
  • 32今日下载