A Fast and Efficient algorithm for Many-To-Many Matching of Points with Demands in One Dimension.
Fatemeh Rajabi-AlniAlireza BagheriPublished in: CoRR (2019)
Keyphrases
- matching algorithm
- computational cost
- single pass
- optimization algorithm
- high efficiency
- computationally efficient
- dynamic programming
- learning algorithm
- matching process
- image matching
- computational complexity
- k means
- cost function
- approximate matching
- detection algorithm
- np hard
- particle swarm optimization
- worst case
- pruning strategy
- graph matching
- stereo correspondence
- dimensional data
- neural network
- similarity measure
- search algorithm
- disparity map
- significant improvement
- image set
- point sets
- convex hull
- search space
- expectation maximization