OpenCV Q&A Forum - RSS feedhttp://answers.opencv.org/questions/OpenCV answersenCopyright <a href="http://www.opencv.org">OpenCV foundation</a>, 2012-2018.Tue, 05 Dec 2017 02:00:27 -0600face recognition by Euclidean space distance seeking for helphttp://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/In the n dimensional Euclidean space,
If
The first point is **P1 [x1,x2,...,xn]**
The second point is **P2 [y1,y2,...,yn]**
so ，the Euclidean space distance from P1 to P2 is
**d(P1,P2) = sqrt ( (x1-y1)^2 + (x2-y2)^2 + ... + (xn-yn)^2 )**
so , in the face recognition field , for example , in many open source ，
every point have x coordinate value and y coordinate value ,
I think it is ,
The first face is **P1 [(x1,y1),(x2,y2),...,(xn,yn)]**
The second face is **P2 [(a1,b1),(a2,b2),...,(an,bn)]**
so ，the Euclidean space distance from P1 to P2 is ________________________________ ?
the result is too complex , even is unsolvable .
I don't know if I have a problem with my understanding ?Mon, 04 Dec 2017 22:01:04 -0600http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/Comment by berak for <p>In the n dimensional Euclidean space,</p>
<p>If
The first point is <strong>P1 [x1,x2,...,xn]</strong></p>
<p>The second point is <strong>P2 [y1,y2,...,yn]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is </p>
<p><strong>d(P1,P2) = sqrt ( (x1-y1)^2 + (x2-y2)^2 + ... + (xn-yn)^2 )</strong></p>
<p>so , in the face recognition field , for example , in many open source ，
every point have x coordinate value and y coordinate value ,</p>
<p>I think it is ,</p>
<p>The first face is <strong>P1 [(x1,y1),(x2,y2),...,(xn,yn)]</strong> </p>
<p>The second face is <strong>P2 [(a1,b1),(a2,b2),...,(an,bn)]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is ________________________________ ? </p>
<p>the result is too complex , even is unsolvable . </p>
<p>I don't know if I have a problem with my understanding ?</p>
http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179739#post-id-179739the pixel values are compared, not their (2d)coordinates.Tue, 05 Dec 2017 01:48:56 -0600http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179739#post-id-179739Comment by berak for <p>In the n dimensional Euclidean space,</p>
<p>If
The first point is <strong>P1 [x1,x2,...,xn]</strong></p>
<p>The second point is <strong>P2 [y1,y2,...,yn]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is </p>
<p><strong>d(P1,P2) = sqrt ( (x1-y1)^2 + (x2-y2)^2 + ... + (xn-yn)^2 )</strong></p>
<p>so , in the face recognition field , for example , in many open source ，
every point have x coordinate value and y coordinate value ,</p>
<p>I think it is ,</p>
<p>The first face is <strong>P1 [(x1,y1),(x2,y2),...,(xn,yn)]</strong> </p>
<p>The second face is <strong>P2 [(a1,b1),(a2,b2),...,(an,bn)]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is ________________________________ ? </p>
<p>the result is too complex , even is unsolvable . </p>
<p>I don't know if I have a problem with my understanding ?</p>
http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179737#post-id-179737just remove the image, and make a text version of it, we can help you with the formattingMon, 04 Dec 2017 22:39:28 -0600http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179737#post-id-179737Comment by striving for <p>In the n dimensional Euclidean space,</p>
<p>If
The first point is <strong>P1 [x1,x2,...,xn]</strong></p>
<p>The second point is <strong>P2 [y1,y2,...,yn]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is </p>
<p><strong>d(P1,P2) = sqrt ( (x1-y1)^2 + (x2-y2)^2 + ... + (xn-yn)^2 )</strong></p>
<p>so , in the face recognition field , for example , in many open source ，
every point have x coordinate value and y coordinate value ,</p>
<p>I think it is ,</p>
<p>The first face is <strong>P1 [(x1,y1),(x2,y2),...,(xn,yn)]</strong> </p>
<p>The second face is <strong>P2 [(a1,b1),(a2,b2),...,(an,bn)]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is ________________________________ ? </p>
<p>the result is too complex , even is unsolvable . </p>
<p>I don't know if I have a problem with my understanding ?</p>
http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179736#post-id-179736ok , I got，should I delete or convert text in comment ?Mon, 04 Dec 2017 22:36:21 -0600http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179736#post-id-179736Comment by berak for <p>In the n dimensional Euclidean space,</p>
<p>If
The first point is <strong>P1 [x1,x2,...,xn]</strong></p>
<p>The second point is <strong>P2 [y1,y2,...,yn]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is </p>
<p><strong>d(P1,P2) = sqrt ( (x1-y1)^2 + (x2-y2)^2 + ... + (xn-yn)^2 )</strong></p>
<p>so , in the face recognition field , for example , in many open source ，
every point have x coordinate value and y coordinate value ,</p>
<p>I think it is ,</p>
<p>The first face is <strong>P1 [(x1,y1),(x2,y2),...,(xn,yn)]</strong> </p>
<p>The second face is <strong>P2 [(a1,b1),(a2,b2),...,(an,bn)]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is ________________________________ ? </p>
<p>the result is too complex , even is unsolvable . </p>
<p>I don't know if I have a problem with my understanding ?</p>
http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179735#post-id-179735the image is unreadable, your question cannot be indexed for search, folks cannot quote you, please just comply.Mon, 04 Dec 2017 22:25:49 -0600http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179735#post-id-179735Comment by striving for <p>In the n dimensional Euclidean space,</p>
<p>If
The first point is <strong>P1 [x1,x2,...,xn]</strong></p>
<p>The second point is <strong>P2 [y1,y2,...,yn]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is </p>
<p><strong>d(P1,P2) = sqrt ( (x1-y1)^2 + (x2-y2)^2 + ... + (xn-yn)^2 )</strong></p>
<p>so , in the face recognition field , for example , in many open source ，
every point have x coordinate value and y coordinate value ,</p>
<p>I think it is ,</p>
<p>The first face is <strong>P1 [(x1,y1),(x2,y2),...,(xn,yn)]</strong> </p>
<p>The second face is <strong>P2 [(a1,b1),(a2,b2),...,(an,bn)]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is ________________________________ ? </p>
<p>the result is too complex , even is unsolvable . </p>
<p>I don't know if I have a problem with my understanding ?</p>
http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179734#post-id-179734I am sorry ，the effect of the formula in the text is not so goodMon, 04 Dec 2017 22:21:32 -0600http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179734#post-id-179734Comment by berak for <p>In the n dimensional Euclidean space,</p>
<p>If
The first point is <strong>P1 [x1,x2,...,xn]</strong></p>
<p>The second point is <strong>P2 [y1,y2,...,yn]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is </p>
<p><strong>d(P1,P2) = sqrt ( (x1-y1)^2 + (x2-y2)^2 + ... + (xn-yn)^2 )</strong></p>
<p>so , in the face recognition field , for example , in many open source ，
every point have x coordinate value and y coordinate value ,</p>
<p>I think it is ,</p>
<p>The first face is <strong>P1 [(x1,y1),(x2,y2),...,(xn,yn)]</strong> </p>
<p>The second face is <strong>P2 [(a1,b1),(a2,b2),...,(an,bn)]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is ________________________________ ? </p>
<p>the result is too complex , even is unsolvable . </p>
<p>I don't know if I have a problem with my understanding ?</p>
http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179733#post-id-179733please do not post images, but **TEXT**,Mon, 04 Dec 2017 22:14:08 -0600http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?comment=179733#post-id-179733Answer by striving for <p>In the n dimensional Euclidean space,</p>
<p>If
The first point is <strong>P1 [x1,x2,...,xn]</strong></p>
<p>The second point is <strong>P2 [y1,y2,...,yn]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is </p>
<p><strong>d(P1,P2) = sqrt ( (x1-y1)^2 + (x2-y2)^2 + ... + (xn-yn)^2 )</strong></p>
<p>so , in the face recognition field , for example , in many open source ，
every point have x coordinate value and y coordinate value ,</p>
<p>I think it is ,</p>
<p>The first face is <strong>P1 [(x1,y1),(x2,y2),...,(xn,yn)]</strong> </p>
<p>The second face is <strong>P2 [(a1,b1),(a2,b2),...,(an,bn)]</strong></p>
<p>so ，the Euclidean space distance from P1 to P2 is ________________________________ ? </p>
<p>the result is too complex , even is unsolvable . </p>
<p>I don't know if I have a problem with my understanding ?</p>
http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?answer=179741#post-id-179741ok , thank you very muchTue, 05 Dec 2017 02:00:27 -0600http://answers.opencv.org/question/179732/face-recognition-by-euclidean-space-distance-seeking-for-help/?answer=179741#post-id-179741