Robust Communication Complexity of Matching: EDCS Achieves 5/6 Approximation.
Amir AzarmehrSoheil BehnezhadPublished in: ICALP (2023)
Keyphrases
- approximation error
- approximation algorithms
- worst case
- model based object recognition
- computer networks
- computational complexity
- scale and rotation invariant
- neural network
- feature points
- pattern matching
- matching algorithm
- space complexity
- communication networks
- communication systems
- affine transformation
- error tolerance
- wide baseline matching
- increase in computational complexity
- feature descriptors
- graph matching
- error bounds
- closed form
- information sharing
- keypoints
- sensor networks
- multi agent systems