Algorithm 1: The high-level description of the MISS100 algorithm

PROCEDURE Match_MISS100

INPUT: the length L of the sensor; the initial state preF = 1, and delta = 0; an intermediate state k.

OUTPUT: strain obtained by the MISS100 method.

%%

IF the image length is divisible by 100, THEN

Match the image I and the image (I-99) based on the feature point matching algorithm

Obtain the distance move

Update delta: delta = delta + move

For k from (I-99) to I

Match the image k and the image (I-99) based on the SURF algorithm

Obtain move2

Calculate the movement of every image, sum: sum = delta + move2

Obtain strain according to sum and L

Save strain

End

Update perF = I-99

End

%%

IF the image length is not divisible by 100, THEN

Calculate the reminder N, representing the number of images in the last group

Match the first image I1 in the last group and the image (I-99) based on SURF

Obtain the distance move

Update delta: delta = delta + move

For k from 1 to N

Match the image k and the image I1 based on SURF

Obtain move3

Calculate the movement of the remaining image, sum: sum = delta + move3

Obtain strain according to sum and L

Save strain

End

End