An O(n log n)-Time Approximation Scheme for Geometric Many-To-Many Matching.
Sayan BandyapadhyayJie XuePublished in: SoCG (2024)
Keyphrases
- polynomial time approximation
- matching scheme
- matching criterion
- matching algorithm
- randomized approximation
- approximation schemes
- lower bound
- approximation algorithms
- geometric transformations
- neural network
- template matching
- matching process
- keypoints
- worst case
- computational complexity
- model based recognition
- error bounds
- graph matching
- data sets
- image quality
- partial matching
- objective function
- polynomial approximation
- geometric consistency