Modeling parameter space behavior of vision systems using Bayesian networks

被引:5
作者
Sarkar, S [1 ]
Chavali, S [1 ]
机构
[1] Univ S Florida, Tampa, FL 33620 USA
基金
美国国家科学基金会;
关键词
parameter selection; parameter tuning; Bayesian networks; vision systems; learning automation; vision and learning;
D O I
10.1006/cviu.2000.0854
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The performance of most vision systems (or subsystems) is significantly dependent on the choice of its various parameters or thresholds. The associated parameter search space is extremely large and nonsmooth, moreover, the optimal choices of the parameters are usually mutually dependent on each other. In this paper we offer a Bayesian network-based probabilistic formalism, which we call the parameter dependence networks (PDNs), to model, abstract, and analyze the parameter space behavior of vision systems. The various algorithm parameters are the nodes of the PDN and are associated with probabilistic beliefs about the optimality of their respective values. The links between the nodes capture the direct dependencies between them and are quantified by conditional belief functions. The PDN structure captures the interdependence among the parameters in a concise and explicit manner. We define information theoretic measures, based on these PDNs, to quantify the global parameter sensitivity and the strength of the interdependence of the parameters. These measures predict the general ease of parameter tuning and performance stability of the system. The PDNs can also be used to stochastically sample the parameter space, to select optimal parameter sets (e.g., in performance evaluation studies), and to choose parameters, given constraints on the choice of some parameters. We also offer a strategy based on stochastic learning automata to generate training data to automatically build these PDNs. The team of learning automata stochastically samples the parameter space in a nonuniform manner with more samples near optimal values. These nonuniform samples are used to infer both the dependency structure and the conditional probabilities of the PDN. We demonstrate the process of construction of the PDN for an isolated vision module with 4 parameters tan edge detector), a coupling of two vision modules with a total of 7 parameters (a small edge grouping module), and a combination of three vision modules with 21 parameters (a complex perceptual organization module). (C) 2000 Academic Press.
引用
收藏
页码:185 / 223
页数:39
相关论文
共 34 条
[21]   A belief-based approach for adaptive image processing [J].
Murino, V ;
Foresti, GL ;
Regazzoni, CS .
INTERNATIONAL JOURNAL OF PATTERN RECOGNITION AND ARTIFICIAL INTELLIGENCE, 1997, 11 (03) :359-392
[22]  
Narendra K. S., 1989, LEARNING AUTOMATA IN
[23]  
Pearl P, 1988, PROBABILISTIC REASON, DOI DOI 10.1016/C2009-0-27609-4
[24]   LEARNING COMPATIBILITY COEFFICIENTS FOR RELAXATION LABELING PROCESSES [J].
PELILLO, M ;
REFICE, M .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1994, 16 (09) :933-945
[25]   Closed-loop object recognition using reinforcement learning [J].
Peng, J ;
Bhanu, B .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1998, 20 (02) :139-154
[26]  
Raftery AE, 1995, SOCIOLOGICAL METHODO
[27]  
Ramesh V., 1992, Proceedings. 1992 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.92CH3168-2), P521, DOI 10.1109/CVPR.1992.223141
[28]  
RAMESH V, 1994, 1994 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, P672, DOI 10.1109/CVPR.1994.323780
[29]  
Rebane G., 1987, RECOVERY CAUSAL POLY, DOI DOI 10.1016/0888-613X(88)90158-2
[30]   Learning to form large groups of salient image features [J].
Sarkar, S .
1998 IEEE COMPUTER SOCIETY CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION, PROCEEDINGS, 1998, :780-786