Bayesian A* Tree Search with Expected O(N) Convergence Rates for Road Tracking

@inproceedings{Coughlan1999BayesianAT,
  title={Bayesian A* Tree Search with Expected O(N) Convergence Rates for Road Tracking},
  author={James M. Coughlan and Alan L. Yuille},
  booktitle={EMMCVPR},
  year={1999}
}
This paper develops a theory for the convergence rates of A* algorithms for real-world vision problems, such as road tracking, which can be formulated in terms of maximizing a reward function derived using Bayesian probability theory. Such problems are well suited to A* tree search and it can be shown that many algorithms proposed to solve them are special cases, or variants, of A*. Moreover, the Bayesian formulation naturally defines a probability distribution on the ensemble of problem… CONTINUE READING
Highly Cited
This paper has 24 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-9 of 9 extracted citations

Fundamental Limits of Bayesian Inference: Order Parameters and Phase Transitions for Road Tracking

IEEE Trans. Pattern Anal. Mach. Intell. • 2000
View 21 Excerpts
Method Support
Highly Influenced

A Min-Cover Approach for Finding Salient Curves

2006 Conference on Computer Vision and Pattern Recognition Workshop (CVPRW'06) • 2006
View 1 Excerpt

Gap closure in (road) networks using higher-order active contours

2004 International Conference on Image Processing, 2004. ICIP '04. • 2004
View 1 Excerpt