Perfect correspondences between dot-depth and polynomial-time hierarchies.

Christian Glaßer Stephen D. Travers Klaus W. Wagner

Published in: J. Comput. Syst. Sci. (2014)

Keyphrases

depth information
special case
depth map
high quality
hierarchical structure
approximation algorithms
pairwise
image features
computational complexity
geometric constraints
feature matching
partial matching
correspondence matching