We investigate the complexity of probabilistic inference from knowledge bases that encode probability distributions on finite domain relational structures. Our interest here lies in the complexity in terms of the domain under consideration in a specific application instance. We obtain the result tha
A low complexity approximation of probabilistic appearance models
β Scribed by Raouf Hamdan; Fabrice Heitz; Laurent Thoraval
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 633 KB
- Volume
- 36
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
β¦ Synopsis
on Computer Vision, Cambridge, MA, June 1995, p. 687; IEEE Trans. Pattern Anal. Mach. Intell. 19 (7) (1997) 696) has recently shown excellent performances in pattern detection and recognition, outperforming most other linear and non-linear approaches. Unfortunately, the complexity of this model remains high. In this paper, we introduce an e cient approximation of this model, which enables fast implementations in statistical estimation-based schemes. Gains in complexity and cpu time of more than 10 have been obtained, without any loss in the quality of the results.
π SIMILAR VOLUMES
## This paper analyzes the number of nodes expanded by A* as a function of the accuracy of its heuristic estimates by treating the errors h * -h as random variables whose distributions may vary over the nodes in the graph. Our model consists of an m -ary tree with unit branch costs and a unique goal
A new approach to the analysis of complex reaction systems in terms of model compound information is described using ifgnin depolymerization as a specific example. Model compound reaction pathways and kinetics were fncorporated into a Monte Carlo-based mathematical model of lignt \(n\) depolymerizat