On the Hardness of Approximating k-Dimensional Matching
Elad HazanShmuel SafraOded SchwartzPublished in: Electron. Colloquium Comput. Complex. (2003)
Keyphrases
- matching algorithm
- image matching
- computational complexity
- correspondence matching
- matching process
- three dimensional
- graph matching
- np complete
- keypoints
- shape matching
- learning theory
- neural network
- feature points
- np hard
- case study
- information systems
- pattern matching
- worst case
- information theoretic
- lower bound
- feature matching
- matching scheme
- np hardness
- approximate matching
- computer vision