Lines Matching full:matches
93 for (size_t j = 0; j < pairwise_matches[dual_pair_idx].matches.size(); ++j)
94 std::swap(pairwise_matches[dual_pair_idx].matches[j].queryIdx,
95 pairwise_matches[dual_pair_idx].matches[j].trainIdx);
114 // These two classes are aimed to find features matches only, not to
155 matches_info.matches.clear();
178 MatchesSet matches;
180 // Find 1->2 matches
190 matches_info.matches.push_back(m0);
191 matches.insert(std::make_pair(m0.queryIdx, m0.trainIdx));
194 LOG("\n1->2 matches: " << matches_info.matches.size() << endl);
196 // Find 2->1 matches
206 if (matches.find(std::make_pair(m0.trainIdx, m0.queryIdx)) == matches.end())
207 matches_info.matches.push_back(DMatch(m0.trainIdx, m0.queryIdx, m0.distance));
209 LOG("1->2 & 2->1 matches: " << matches_info.matches.size() << endl);
215 matches_info.matches.clear();
225 MatchesSet matches;
227 // Find 1->2 matches
238 matches_info.matches.push_back(m0);
239 matches.insert(std::make_pair(m0.queryIdx, m0.trainIdx));
243 // Find 2->1 matches
253 if (matches.find(std::make_pair(m0.trainIdx, m0.queryIdx)) == matches.end())
254 matches_info.matches.push_back(DMatch(m0.trainIdx, m0.queryIdx, m0.distance));
516 matches = other.matches;
583 if (matches_info.matches.size() < static_cast<size_t>(num_matches_thresh1_))
587 Mat src_points(1, static_cast<int>(matches_info.matches.size()), CV_32FC2);
588 Mat dst_points(1, static_cast<int>(matches_info.matches.size()), CV_32FC2);
589 for (size_t i = 0; i < matches_info.matches.size(); ++i)
591 const DMatch& m = matches_info.matches[i];
617 matches_info.confidence = matches_info.num_inliers / (8 + 0.3 * matches_info.matches.size());
619 // Set zero confidence to remove matches between too close images, as they don't provide
631 for (size_t i = 0; i < matches_info.matches.size(); ++i)
636 const DMatch& m = matches_info.matches[i];
