登录
首页 » Visual C++ » DLT

DLT

于 2013-09-05 发布 文件大小:308KB
0 241
下载积分: 1 下载次数: 58

代码说明:

  基于visual c++平台,相机标定方法中的直接线性变换方法,即DLT方法(Based on visual c++ platform, camera calibration method of direct linear transformation method, namely DLT method)

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

发表评论

0 个回复

  • fingertips
    利用OpenCV实现单幅图片对于手指的精确识别(Single image using OpenCV to achieve precise identification of the finger)
    2011-02-11 17:09:05下载
    积分:1
  • HOG
    读取一24位彩色图像,计算其以下图像特征: 1)灰度直方图 2)颜色直方图(RGB3个通道) 3)方向梯度直方图(HOG,将图像分成4*4 16个块,8个梯度方向) (Read a 24-bit color images, calculate the following image features: 1) Histogram 2) color histogram (RGB3 channels) 3) histogram of oriented gradients (HOG, the image is divided into 4* 4 16 blocks, 8 gradient directions))
    2020-06-28 15:00:01下载
    积分:1
  • Fngprnt
    采用最大方差阈值分割法,对指纹进行提取。(Using the maximum variance threshold segmentation method for fingerprint extraction.)
    2013-11-24 20:39:58下载
    积分:1
  • ji
    说明:  基于图像变换的火炮身管膛线参数检测技术研究(Based on image transform the Gun Barrel rifling parameter detection technology)
    2013-03-07 09:16:32下载
    积分:1
  • jitu
    说明:  计算机图形学基本算法 DDA直线 中点直线 BRESEMHAM圆 正负法圆 B样条曲线 B曲线 (DDA line algorithm for computer graphics, the midpoint of the basic straight-line method BRESEMHAM circle round the positive and negative B-spline curve B curve)
    2010-04-19 20:38:49下载
    积分:1
  • 首OPENCV单目标定
    相机的单目标定,使用张正友标定法,可靠使用(The monocular camera calibration, using the zhangzhengyou calibration method, reliable use)
    2017-09-23 20:48:47下载
    积分:1
  • retinex.opencv
    Retinex理论的基础理论是物体的颜色是由物体对长波(红色)、中波(绿色)、短波(蓝色)光线的反射能力来决定的,而不是由反射光强度的绝对值来决定的,物体的色彩不受光照非均匀性的影响,具有一致性,即retinex是以色感一致性(颜色恒常性)为基础的。不同于传统的线性、非线性的只能增强图像某一类特征的方法,Retinex可以在动态范围压缩、边缘增强和颜色恒常三个方面打到平衡,因此可以对各种不同类型的图像进行自适应的增强。(The basic theory of Retinex theory is the color of the object by object for the long wavelength (red), medium (green), short wave (blue) light reflection ability to decide, rather than by the intensity of reflected light of the absolute value to decide, the color of the object under illumination nonuniformity effects, consistent with the Retinex, that is based on color constancy (color constancy based). Different from the traditional linear, nonlinear image enhancement method of only one kind of features, Retinex can be in dynamic range compression, edge enhancement and three aspects of color constancy hit the balance, thus enhancing adaptive to a variety of different types of images can be.)
    2014-09-23 16:40:19下载
    积分:1
  • LMD
    自己编写的数字图像处理程序,包括打开bmp图像,直方图,阈值分割,形态学处理等功能。(digital image processing procedures, including open bmp image, histogram, threshold segmentation, morphological processing and other functions.)
    2013-11-14 22:17:45下载
    积分:1
  • photo
    vc++6.0进行编程实现对图像的平移处理(vc++6.0 program to achieve the translation of the image processing)
    2009-04-26 10:26:37下载
    积分:1
  • algorithm-of-findpath
    绣花问题是连续型的填充,在不同区域的缝制过程中,缝针不能提针,因此不能用一般的离散型区 域填充方法处理。本文运用几何计算和图论理论提出了一个绣花缝针轨迹自动生成算法:先对轮廓走向进行 定义,通过轮廓铅垂方向的局部极值点的分割线将图案从上向下进行分割,采用交点的特征值比较彻底的解 决了分割时的重点问题,将图案区域准确的划分成缝针能一次完成的若干个节点。在此基础上根据节点的邻 接关系建立节点的邻接“图”,通过图论中半哈密尔顿路径或深度遍历方法找到节点的遍历(缝制)序列和每 个节点的缝制方向,最后可对设定的起点、终点和缝针间隔的条件自动提供缝针的走向轨迹。(In the process of embroidering, needle can not hang up for changing to a different area. Therefore, Embroider problem could be abstract as a continuous area-filling work. Considering disperse area-filling methods can not process this problem well. Based on geometry computing and graph theory, an algorithm of finding path of embroidering needle are proposed in this paper. First, outline orientations are defined, and finding all local extreme points of inner outline on their gravitational orientation to build sectioning lines so as to divide the picture. By using intersection point character the overlap point problem was solved perfectly. Therefore, the picture is divided into some nodes which can be finished alone. Then, based on connections of these nodes, an adjacency graph of nodes was built. Using half-Hamilton path or depth-first search method, both embroidering sequence and direction of these nodes could be got from the graph. Finally, from a defined start-point, end-point)
    2012-12-09 23:26:22下载
    积分:1
  • 696518资源总数
  • 106227会员总数
  • 11今日下载