An efficient algorithm for 1-dimensional (persistent) path homology.
Tamal K. DeyTianqi LiYusu WangPublished in: CoRR (2020)
Keyphrases
- learning algorithm
- optimization algorithm
- computationally efficient
- computational cost
- cost function
- optimal solution
- improved algorithm
- worst case
- preprocessing
- np hard
- recognition algorithm
- experimental evaluation
- significant improvement
- high accuracy
- multi dimensional
- shortest path problem
- theoretical analysis
- segmentation algorithm
- memory efficient
- convergence rate
- convex hull
- path planning
- estimation algorithm
- tree structure
- detection algorithm
- expectation maximization
- simulated annealing
- probabilistic model
- dynamic programming
- search space
- high dimensional
- computational complexity
- image sequences