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

please do not post images, but

TEXT,I am sorry ，the effect of the formula in the text is not so good

the image is unreadable, your question cannot be indexed for search, folks cannot quote you, please just comply.

ok , I got，should I delete or convert text in comment ?

just remove the image, and make a text version of it, we can help you with the formatting

the pixel values are compared, not their (2d)coordinates.

ok , thank you very much