Evolving visual sonar: Depth from monocular images

被引:16
作者
Martin, C. Martin [1 ]
机构
[1] Carnegie Mellon Univ, Mobile Robot Lab, Pittsburgh, PA 15213 USA
关键词
genetic programming; robotics; visual navigation; monocular vision;
D O I
10.1016/j.patrec.2005.07.015
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To recover depth from images, the human visual system uses many monocular depth cues, which vision research has only begun to explore. Because a given image can have many possible interpretations, constraints are needed to eliminate ambiguity, and the most powerful constraints are domain specific. As an experiment in the automatic discovery and exploitation of constraints, genetic programming was used to find algorithms for obstacle detection. The algorithms are designed to be a replacement for sonar, returning the location of the nearest obstacle in a given direction. The evolved algorithms worked surprisingly well. Errors were largely transient. The algorithms generalized to both novel views of the office environment and to unseen obstacles. They were combined with a simple reactive wandering program originally written for sonar. The result exhibited good performance in an office environment, colliding only with obstacles outside the robot's field of view. Time to collision results and failure modes are presented. Code is available for download. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:1174 / 1180
页数:7
相关论文
共 27 条
[1]  
Arkin R., 1999, BEHAV BASED ROBOTICS
[2]   Using Learning to Facilitate the Evolution of Features for Recognizing Visual Concepts [J].
Bala, J. ;
De Jong, K. ;
Huang, J. ;
Vafaie, H. ;
Wechsler, H. .
EVOLUTIONARY COMPUTATION, 1996, 4 (03) :297-311
[3]  
BALA JK, 1996, INT C PATT REC VIENN
[4]  
Benson K., 2000, BMV2000. Proceedings of the 11th British Machine Vision Conference, P685
[5]  
CAMUS T, 1999, J COMPUTER VISION RE, P1
[6]  
CLIFF D, 1993, P SAB92 2 INT C SIM
[7]  
Duda R. O., 2000, PATTERN CLASSIFICATI
[8]  
EBNER M, 1998, EUR 98 1 EUR WORKSH, P6
[9]  
GUARDA A, 1998, INT S COMP GRAPH IM
[10]  
HARRIS C, 1997, THESIS U COLL LONDON