An O(n^2) algorithm for Many-To-Many Matching of Points with Demands in One Dimension.
Fatemeh Rajabi-AlniAlireza BagheriPublished in: CoRR (2017)
Keyphrases
- matching algorithm
- convex hull
- image matching
- detection algorithm
- objective function
- string matching
- search space
- k means
- matching process
- learning algorithm
- preprocessing
- np hard
- experimental evaluation
- feature points
- high accuracy
- significant improvement
- recognition algorithm
- matching scheme
- neural network
- keypoints
- pattern matching
- optimization algorithm
- expectation maximization
- linear programming
- simulated annealing
- worst case
- computational complexity
- similarity measure