Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy.
Christian GlaßerStephen D. TraversKlaus W. WagnerPublished in: Developments in Language Theory (2006)
Keyphrases
- special case
- pairwise
- worst case
- computational complexity
- approximation algorithms
- transformation parameters
- depth map
- hierarchical structure
- partially overlapping
- image matching
- correspondence matching
- camera pose
- geometric constraints
- point correspondences
- three dimensional
- lower bound
- objective function
- high quality