Replies: 1 comment 1 reply
-
It doesn't matter. You can do it either way. |
Beta Was this translation helpful? Give feedback.
1 reply
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
-
Hi,
im not 200% sure if its a bug or something i dont quite understand.
In the examples for the chinese cluster algorithm
(https://github.com/davisking/dlib/blob/master/examples/dnn_face_recognition_ex.cpp)
why do all examples build edges for edge node to themself
for (size_t i = 0; i < face_descriptors.size(); ++i) { 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 // decision threshold the network was trained to use. Although you can // certainly use any other threshold you find useful. if (length(face_descriptors[i]-face_descriptors[j]) < 0.6) edges.push_back(sample_pair(i,j)); } }
in other words why isnt it
for (size_t j = i+1; j < face_descriptors.size(); ++j)
Thanks!
Beta Was this translation helpful? Give feedback.
All reactions