Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms.
Esther M. ArkinKlara KedemJoseph S. B. MitchellJosef SprinzakMichael WermanPublished in: INFORMS J. Comput. (1992)
Keyphrases
- pairwise
- keypoints
- upper bound
- worst case
- theoretical analysis
- upper and lower bounds
- noisy data
- point sets
- markov random field
- learning algorithm
- lower bound
- data structure
- scale invariant features
- optical flow
- computational complexity
- graph matching
- noise level
- higher order relations
- boundary points
- theoretical guarantees
- computational geometry
- average case
- shape matching
- error bounds
- matching algorithm
- loss function
- input image
- data points