A framework algorithm for dynamic, centralized dimension-bounded timestamps.
Paul A. S. WardPublished in: CASCON (2000)
Keyphrases
- experimental evaluation
- detection algorithm
- dynamic programming
- learning algorithm
- optimal solution
- computational complexity
- preprocessing
- k means
- mobile robot
- graph based algorithm
- bayesian framework
- matching algorithm
- clustering method
- optimization algorithm
- segmentation algorithm
- cost function
- worst case
- expectation maximization
- probabilistic model
- neural network
- improved algorithm
- selection algorithm
- times faster
- key features
- classification algorithm
- tree structure
- high accuracy
- temporal information
- simulated annealing
- recognition algorithm
- input data
- theoretical analysis
- graph cuts