首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   28篇
  国内免费   1篇
  完全免费   12篇
  自动化技术   41篇
  2017年   3篇
  2015年   1篇
  2014年   3篇
  2013年   2篇
  2012年   2篇
  2011年   3篇
  2010年   3篇
  2009年   1篇
  2008年   4篇
  2007年   1篇
  2006年   3篇
  2005年   1篇
  2004年   4篇
  2003年   2篇
  2002年   2篇
  2001年   1篇
  2000年   1篇
  1990年   1篇
  1988年   1篇
  1987年   2篇
排序方式: 共有41条查询结果,搜索用时 109 毫秒
1.
一种利用Hausdorff距离的高效目标搜索算法   总被引:8,自引:0,他引:8  
为了快速高效地进行目标搜索,提出了一种在仿射变换条件下,利用Hausdroff距离进行目标搜索的高效算法。此算法是在一种新的距离变换形式——“最小正方盒距离变换”的基础上进行的。实验结果表明,与现有算法相比,该算法在不影响搜索成功率和目标定位精度的情况下,还可以显著地缩短搜索时间。为验证该算法的有效性,将该算法与Rucklidge算法进行了对比实验,结果表明,该算法明显优于Rucklidge提出的快速目标搜索算法。  相似文献
2.
基于模糊优化的物流配送路径(MLRP)问题研究   总被引:4,自引:0,他引:4  
研究采用嵌入模糊决策规则的遗传算法(即模糊优化方法)求解物流配送多目标定位-运输路线安排问题(MLRP),重点考虑了时间和运输成本两个目标的MLRP的求解方法.该算法分成3个阶段,首先利用遗传算法对初始种群搜索选择优化配送路径;然后应用配送网络调度算法综合评价来确定配送路径中的关键路径和非关键路径;最后根据模糊决策规则计算其各个调度相应的指标,并对已挑选出来的染色体中的某些位基因进行调整,以提高算法的收敛性.计算机仿真结果证明了将此混合算法用于求解中、小规模物流配送问题的有效性.  相似文献
3.
基于聚类的位置数据库动态重组   总被引:4,自引:2,他引:2       下载免费PDF全文
在无线移动计算环境中,如何合理地组织和存储移动对象(mobile object)的配置信息从而有效地降低查询和更新代价是位置管理(location management)中的一个重要问题.将数据挖掘应用到移动计算环境中是一项具有挑战性的研究课题,具有广阔的应用前景.从数据挖掘的角度出发,提出了一种优化位置数据库的解决方案.首先采用一种新的层次聚类算法对移动日志聚类,然后根据聚类的结果对位置数据库动态重组,从而有效地降低了查询和更新代价.  相似文献
4.
基于单幅图像确定目标空间方位新方法的测距系统   总被引:4,自引:0,他引:4  
提出了一种新的由单幅二维投影图像确定目标三维空间方位的方法,即在照、摄象机内部参数未知的条件下,采用目标上共面四线与他们在二维图像上投影相匹配的策略,来实现目标的定位;并将其应用于测距系统,因此该方法与以前方法相比,更附和实际需要,从而具有广泛的实际应用推广价值。  相似文献
5.
On improving the accuracy of the Hough transform   总被引:3,自引:0,他引:3  
The subject of this paper is very high precision parameter estimation using the Hough transform. We identify various problems that adversely affect the accuracy of the Hough transform and propose a new, high accuracy method that consists of smoothing the Hough arrayH(, ) prior to finding its peak location and interpolating about this peak to find a final sub-bucket peak. We also investigate the effect of the quantizations and ofH(, ) on the final accuracy. We consider in detail the case of finding the parameters of a straight line. Using extensive simulation and a number of experiments on calibrated targets, we compare the accuracy of the method with results from the standard Hough transform method of taking the quantized peak coordinates, with results from taking the centroid about the peak, and with results from least squares fitting. The largest set of simulations cover a range of line lengths and Gaussian zero-mean noise distributions. This noise model is ideally suited to the least squares method, and yet the results from the method compare favorably. Compared to the centroid or to standard Hough estimates, the results are significantly better—for the standard Hough estimates by a factor of 3 to 10. In addition, the simulations show that as and are increased (i.e., made coarser), the sub-bucket interpolation maintains a high level of accuracy. Experiments using real images are also described, and in these the new method has errors smaller by a factor of 3 or more compared to the standard Hough estimates.  相似文献
6.
计算机视觉在机器人目标定位中的应用   总被引:3,自引:0,他引:3  
王俊修  孔斌 《微机发展》2003,13(12):7-10
计算机视觉是一门新兴的发展迅速的学科,计算机视觉的研究已经历了从实验室走向实际应用的发展阶段。由于视觉信息容量大,在实际应用中直观有效,所以运用视觉来寻找和确定目标的方位是机器人发展中一个很重要的方法,近年来它广泛应用于工业自动化装配领域中,同时对视觉系统的要求也越来越高。文中介绍并分析了当前国内外基于视觉的几种主要的目标定位方法在实际中的应用,例如移动机器人自主导航定位系统、手眼立体视觉系统等。  相似文献
7.
Bayesian Object Localisation in Images   总被引:2,自引:0,他引:2  
A Bayesian approach to intensity-based object localisation is presented that employs a learned probabilistic model of image filter-bank output, applied via Monte Carlo methods, to escape the inefficiency of exhaustive search.An adequate probabilistic account of image data requires intensities both in the foreground (i.e. over the object), and in the background, to be modelled. Some previous approaches to object localisation by Monte Carlo methods have used models which, we claim, do not fully address the issue of the statistical independence of image intensities. It is addressed here by applying to each image a bank of filters whose outputs are approximately statistically independent. Distributions of the responses of individual filters, over foreground and background, are learned from training data. These distributions are then used to define a joint distribution for the output of the filter bank, conditioned on object configuration, and this serves as an observation likelihood for use in probabilistic inference about localisation.The effectiveness of probabilistic object localisation in image clutter, using Bayesian Localisation, is illustrated. Because it is a Monte Carlo method, it produces not simply a single estimate of object configuration, but an entire sample from the posterior distribution for the configuration. This makes sequential inference of configuration possible. Two examples are illustrated here: coarse to fine scale inference, and propagation of configuration estimates over time, in image sequences.  相似文献
8.
Distributed match-making   总被引:1,自引:0,他引:1  
In many distributed computing environments, processes are concurrently executed by nodes in a store- and-forward communication network. Distributed control issues as diverse as name server, mutual exclusion, and replicated data management involve making matches between such processes. We propose a formal problem called distributed match-making as the generic paradigm. Algorithms for distributed match-making are developed and the complexity is investigated in terms of messages and in terms of storage needed. Lower bounds on the complexity of distributed match-making are established. Optimal algorithms, or nearly optimal algorithms, are given for particular network topologies.The work of the second author was supported in part by the Office of Naval Research under Contract N00014-85-K-0168, by the Office of Army Research under Contract DAAG29-84-K-0058, by the National Science Foundation under Grant DCR-83-02391, and by the Defence Advanced Research Projects Agency (DARPA) under Contract N00014-83-K-0125. Current address of both authors: CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands.  相似文献
9.
Genetic algorithm with competitive image labelling and least square   总被引:1,自引:0,他引:1  
Shiu Yin  Chi Ho 《Pattern Recognition》2000,33(12):1949-1966
A multi-modal genetic algorithm using a dynamic population concept is introduced. Each image point is assigned a label and for a chromosome to survive, it must have at least one image point with its label. In this way, the genetic algorithm dynamically segments the scene into one or more objects and the background noise. A Repeated Least Square technique is applied to enhance the convergence performance. The integrated algorithm is tested using a 6 degrees of freedom template matching problem, and it is applied to some images that are challenging for genetic algorithm applications.  相似文献
10.
在非结构化P2P网络中的搜索算法研究   总被引:1,自引:1,他引:0  
庞庆元  林亚平 《计算机工程与设计》2006,27(21):4049-4051,4057
Peer-to-Peer系统已经引起了越来越多网络用户的关注。而这种系统的一个核心技术是搜索算法。洪泛是应用在非结构化P2P网络中的基本搜索方法。它具有响应时间短,搜索成功率高,可靠性好等优点;它的不足是会产生大量多余搜索消息,消耗带宽等。根据洪泛和随机漫步的特性,在此提出选择洪泛算法。该算法维持了洪泛的优点,同时又降低多余消息的产生。从模拟实验可以看出,算法有效地降低了多余消息的产生,改善了网络运行环境。  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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