Evolution-based methods for selecting point data for object localization: Applications to computer-assisted surgery

被引:8
作者
Baluja, S
Simon, D
机构
[1] Justsyst Pittsburgh Res Ctr, Pittsburgh, PA 15213 USA
[2] Carnegie Mellon Univ, Sch Comp Sci, Pittsburgh, PA 15213 USA
关键词
object localization; registration; genetic algorithms; population-based incremental learning; computer-assisted surgery;
D O I
10.1023/A:1008230929638
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Object localization has applications in many areas of engineering and science. The goal is to spatially locate an arbitrarily shaped object. In many applications, it is desirable to minimize the number of measurements collected while ensuring sufficient localization accuracy. In surgery, for example, collecting a large number of localization measurements may either extend the time required to perform a surgical procedure or increase the radiation dosage to which a patient is exposed. Localization accuracy is a function of the spatial distribution of discrete measurements over an object when measurement noise is present. In previous work (J. of Image Guided Surgery, Simon et al., 1995), metrics were presented to evaluate the information available from a set of discrete object measurements. In this study, new approaches to the discrete point data selection problem are described. These include hillclimbing, genetic algorithms (GAs), and Population-Based Incremental Learning (PBIL). Extensions of the standard GA and PBIL methods that employ multiple parallel populations are explored. The results of extensive empirical testing are provided. The results suggest that a combination of PBIL and hillclimbing result in the best overall performance. A computer-assisted surgical system that incorporates some of the methods presented in this paper is currently being evaluated in cadaver trials.
引用
收藏
页码:7 / 19
页数:13
相关论文
共 26 条
[1]  
Baluja S., 1995, MACH LEARN, P38
[2]  
BALUJA S, 1997, ADV NEURAL INFORMATI, V9
[3]  
BALUJA S, 1995, CMUCS95193 SCH COMP
[4]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[5]  
COHOON J, 1988, TR8812 U VIRG SCH EN
[6]  
Davidor Y., 1991, PROC 4 INTNATL C GEN, P257
[7]  
De Jong K. A., 1975, ANAL BEHAV CLASS GEN
[8]  
FANG HL, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P375
[9]  
FURUYA H, 1993, PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P536
[10]  
Goldberg D., 1989, GENETIC ALGORITHMS S