首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   5篇
  免费   0篇
教育   3篇
科学研究   2篇
  2009年   1篇
  2005年   1篇
  2004年   2篇
  2000年   1篇
排序方式: 共有5条查询结果,搜索用时 171 毫秒
1
1.
The linear multi-baseline stereo system introduced by the CMU-RI group has been proven to be a very effective and robust stereovision system. However, most traditional stereo rectification algorithms are all designed for binocular stereovision system, and so, cannot be applied to a linear multi-baseline system. This paper presents a simple and intuitional method that can simultaneously rectify all the cameras in a linear multi-baseline system. Instead of using the general 8-parameter homography transform, a two-step virtual rotation method is applied for rectification, which results in a more specific transform that has only 3 parameters, and more stability. Experimental results for real stereo images showed the presented method is efficient.  相似文献   
2.
基于对称函数产生器的对称函数实现   总被引:2,自引:0,他引:2  
为直接利用现有逻辑器件实现多输出对称函数,通过对2线-4线译码器的逻辑功能和二变量基本对称函数的定义的比较,提出2线-4-线译码器可用作二变量基本对称函数产生器。由于任意n变量的基本对称函数均可通过二变量基本对称函数产生器的树型扩展得到实现,因此,任意n变量的对称函数可以用2线-4线译码器予以实现。文中分别就变量数为奇数和偶数的情况进行了讨论。本文提出的对称函数综合方法在实现多输出对称函数时可获得  相似文献   
3.
INTRODUCTION Stereo rectification is a crucial processing forany practical stereovision system; and is aimedtransform images so that the conjugate epipolarlines are aligned horizontally and in parallel. Variedand numerous rectification algorithms have beengiven in literature (Ayache and Lustman, 1991;Fusiello et al., 2000; Hartley, 1999; Robert et al.,1995; Mulligan and Kaniilidis, 2000; Isgro andTrucco, 1999). Most of them involve applying ahomography transformation for that purpose. …  相似文献   
4.
排序是最基础的算法之一,它应用极为广泛,应用于各个领域,不仅是数据库的核心技术,它本身也有广泛的应用场合。我们采用了分块排序、并归执行的算法,这样通过并发多个进程进行排序,通过对进程的同步的控制,合理的在内存中分配读进程和写进程,减少cpu与硬件的冲突,提高了效率。  相似文献   
5.
INTRODUCTION The path planning problem of a mobile robot is to find a safe and efficient path for the robot, given a start location, a goal location and a set of obstacles distributed in a workspace. The robot can go from the start location to the goal location without colliding with any obstacle along the path. In addition to the fundamental problem, we also try to find a way to optimize the plan, say to minimize the time required or distance traveled (Wu et al., 1996; Sadati and Ta-he…  相似文献   
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号