On Matching Robustness
نویسندگان
چکیده
We introduce the notion of robustness of the minimum-weight perfect matching. The robustness measures how much the edge weights of a graph are allowed to change before the minimum-weight matching changes. We consider two cases: when the edge weights are changed adversarially and when they are changed randomly. We provide algorithms for computing the robustness in both cases.
منابع مشابه
Fast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملVideo sequence matching based on temporal ordinal measurement
This paper proposes a novel video sequence matching method based on temporal ordinal measurements. Each frame is divided into a grid and corresponding grids along a time series are sorted in an ordinal ranking sequence, which gives a global and local description of temporal variation. A video sequence matching means not only finding which video a query belongs to, but also a precise temporal lo...
متن کاملA Robust Point Sets Matching Method
Xiao Liu, Congying Han, Tiande Guo School of Mathematical Science, University of Chinese Academy of Sciences, Beijing, 100049 Abstract Point sets matching method is very important in computer vision, feature extraction, fingerprint matching, motion estimation and so on. This paper proposes a robust point sets matching method. We present an iterative algorithm that is robust to noise case. First...
متن کاملA Fast and Robust Scene Matching Method for Navigation
The selection of matching method is critical to the scene matching navigation system, as it determines the accuracy of navigation. A coarse-to-fine matching method, which combines the area-based and feature-based matching method, is presented to meet the requirements of navigation, including the real-time performance, the sub-pixel accuracy and the robustness. In the coarse matching stage, the ...
متن کاملImproving the Robustness of Weighted Scan Matching with Quad Trees
This paper presents the improvement the robustness and accuracy of the weighted scan matching algorithm matching against the union of earlier acquired scans. The approach allows to reduce the correspondence error, which is explicitly modeled in the weighted scan matching algorithm, by providing a more complete and denser frame of reference to match new scans. By making use of the efficient quad...
متن کامل