This is what I handed in today. Question B (one of the three questions), in which a.bmp face is not necessarily all positive, and b.bmp face is not necessarily all negative.

Firstly, the pictures are classified according to the gray value (the maximum matching degree is 180, and 180 lines are all matched). On the basis of classification, the picture is divided into four cases, the least square method σ (a-b) 2? , divided into four situations:

Mainly divided into the following four situations to match:

Damn, I wanted to paste the mathematical formula, but the input doesn't support it! ! !

Then the highest comprehensive matching degree is calculated and spliced.

Then display your spliced gray value matrix as a picture, so that you can directly look at the whole picture and find out the unreasonable connections. The picture above shows .................., a completely spliced photo of me.