Multi-scale LPA* with low worst-case complexity guarantees.
Yibiao LuXiaoming HuoOktay ArslanPanagiotis TsiotrasPublished in: IROS (2011)
Keyphrases
- worst case
- multiscale
- theoretical guarantees
- greedy algorithm
- np hard
- average case
- upper bound
- lower bound
- space complexity
- running times
- scale space
- approximation algorithms
- error bounds
- computational complexity
- decision trees
- image representation
- worst case analysis
- worst case bounds
- local binary pattern
- database
- np complete
- optic flow
- high levels
- natural images
- object recognition
- computer vision
- constant factor
- machine learning
- complexity bounds
- data sets