A Generalized A* Algorithm for Finding Globally Optimal Paths in Weighted Colored Graphs.
Jaein LimPanagiotis TsiotrasPublished in: CoRR (2020)
Keyphrases
- globally optimal
- learning algorithm
- locally optimal
- graph cuts
- computational complexity
- dynamic programming
- matching algorithm
- graph structure
- optimal path
- higher dimensional
- cost function
- np hard
- global optimality
- worst case
- piecewise linear
- machine learning
- path finding
- theoretical guarantees
- maximum clique
- image segmentation
- pairwise
- weighted graph
- detection algorithm
- multi view
- simulated annealing
- probabilistic model
- k means