Algorithm 1 The calculation of the proposed method.

Input: Image $\mathbf{I}$ Output: The matching score (Smatching)  1: $\mathbf{I}=\mathrm{Blocking}\left(\mathbf{I}\right)$  2: for $i=1\to p$ do  3:    for $j=1\to q$ do  4:      $I^{\prime }(i,j)=\mathrm{mean}\left({\mathbf{I}}_{ij}\right)$  5:    end for  6: end for  7: Divide ${\mathbf{I}}^{\prime }$ into m blocks of $3\times 3$ matrix, i.e ${\mathbf{I}}_1^{\prime },...,{\mathbf{I}}_m^{\prime }$  8: Calculate ${\mathbf{x}}_i=\mathrm{CS}-\mathrm{LBP}\left({\mathbf{I}}_i^{\prime }\right)$  9: Set $\mathbf{x}=\left({\mathbf{x}}_1\right|\left|{\mathbf{x}}_2\right||\cdots |\left|{\mathbf{x}}_m\right)$  10: The enrolled binary codes: $\{{\mathbf{x}}^{\left(n\right)}:n=1,2,\cdots ,N\}$  11: for $n=1\to N$ do  12:    $S_n=\mathrm{sum}({\mathbf{x}}^{\left(n\right)}\oplus \mathbf{x})$  13: end for  14: $\mathrm{Smatching}=\frac{\underset{n}{min}{S}_n}{\mathrm{Length}\left(\mathbf{x}\right)}$