Changed graph construction for chinese_whispers() so that each face is always

included in the edge graph.  If it isn't then the output labels from
chinese_whispers would be missing faces in this degenerate case.
pull/919/head
Davis King 7 years ago
parent 347257cbc0
commit dc0245af05

@ -142,7 +142,7 @@ int main(int argc, char** argv) try
std::vector<sample_pair> edges;
for (size_t i = 0; i < face_descriptors.size(); ++i)
{
for (size_t j = i+1; j < face_descriptors.size(); ++j)
for (size_t j = i; j < face_descriptors.size(); ++j)
{
// Faces are connected in the graph if they are close enough. Here we check if
// the distance between two face descriptors is less than 0.6, which is the

Loading…
Cancel
Save