Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking

DOI10.1162/089976602760128072MaRDI QIDQ3149527zbMATH OpenOpenAlexWikidataFDO

Authors James M. Coughlan, Alan Yuille

Publication date 25 September 2002

Published in Neural Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1162/089976602760128072

Mathematics Subject Classification ID

Bayesian inference (62F15) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• scientific article; zbMATH DE number 2100534
• Heuristic tree search with nonparametric statistical inference methods
• New approaches for understanding the asymptotic complexity of \(A^*\) tree searching.
• scientific article; zbMATH DE number 67459
• All roads lead to Rome -- new search methods for the optimal triangulation problem

Cites work

• Order parameters for detecting target curves in images: When does high level knowledge help?
• Searching for an optimal path in a tree with random costs

Cited in

(3)

• Recursive compositional models for vision: description and review of recent work
• Characterizing marginalization and incremental operations on the Bayes tree
• SLEDGE: sequential labeling of image edges for boundary detection

This page was built for publication: Bayesian A* Tree Search with Expected O(N) Node Expansions: Applications to Road Tracking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3149527)