This forum is disabled, please visit https://forum.opencv.org

1 | initial version |

~~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 ?

In the n dimensional Euclidean ~~space,
~~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)]
~~[(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 ?

In the n dimensional Euclidean space,

If
The first point is P1 ~~[x1,x2,...,xn]
~~[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 ?

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 ?

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 = 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)] ~~**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 ?

Copyright OpenCV foundation, 2012-2018. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.