crosstyan/RapidPoseTriangulation
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Renamed a parameter.

Browse Source
This commit is contained in:
Daniel
2024-12-09 14:17:35 +01:00
parent 23108dd594
commit 07f75c53ee
7 changed files with 19 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
rpt/triangulator.cpp
View File

@ -102,9 +102,9 @@ void CameraInternal::update_projection_matrix()
// =================================================================================================
// =================================================================================================
TriangulatorInternal::TriangulatorInternal(float min_score, size_t min_group_size)
TriangulatorInternal::TriangulatorInternal(float min_match_score, size_t min_group_size)
{
this->min_score = min_score;
this->min_match_score = min_match_score;
this->min_group_size = min_group_size;
}
@ -241,7 +241,7 @@ std::vector<std::vector<std::array<float, 4>>> TriangulatorInternal::triangulate
stime = std::chrono::high_resolution_clock::now();
// Check matches to old poses
float threshold = min_score - 0.2;
float threshold = min_match_score - 0.2;
std::map<size_t, std::map<size_t, std::vector<size_t>>> scored_pasts;
if (!last_poses_3d.empty())
{
@ -447,7 +447,7 @@ std::vector<std::vector<std::array<float, 4>>> TriangulatorInternal::triangulate
size_t num_poses = all_scored_poses.size();
for (size_t i = num_poses; i > 0; --i)
{
if (all_scored_poses[i - 1].second < min_score)
if (all_scored_poses[i - 1].second < min_match_score)
{
all_scored_poses.erase(all_scored_poses.begin() + i - 1);
all_pairs.erase(all_pairs.begin() + i - 1);
@ -456,7 +456,7 @@ std::vector<std::vector<std::array<float, 4>>> TriangulatorInternal::triangulate
// Group pairs that share a person
std::vector<std::tuple<cv::Point3f, cv::Mat, std::vector<int>>> groups;
groups = calc_grouping(all_pairs, all_scored_poses, min_score);
groups = calc_grouping(all_pairs, all_scored_poses, min_match_score);
// Drop groups with too few matches
size_t num_groups = groups.size();
@ -508,7 +508,7 @@ std::vector<std::vector<std::array<float, 4>>> TriangulatorInternal::triangulate
poses.push_back(all_full_poses[idx]);
}
auto merged_pose = merge_group(poses, min_score);
auto merged_pose = merge_group(poses, min_match_score);
all_merged_poses[i] = (merged_pose);
}
@ -548,7 +548,7 @@ std::vector<std::vector<std::array<float, 4>>> TriangulatorInternal::triangulate
}
pose.push_back(point);
if (point[3] > min_score)
if (point[3] > min_match_score)
{
num_valid++;
}
@ -1860,7 +1860,7 @@ void TriangulatorInternal::add_missing_joints(
for (size_t j = 0; j < num_joints; ++j)
{
float *pose_ptr = pose.ptr<float>(j);
if (pose_ptr[3] > min_score)
if (pose_ptr[3] > min_match_score)
{
valid_joint_idx.push_back(j);
}