Algorithm 1 Find Most Frequent Scale.

Require:B—an array of best scale factors, $\xi$—the range threshold (default: $\xi =0.0002$), n—the length of the array B 1:$i\leftarrow 0$ 2:while$i<n$do 3:    $s_i\leftarrow B.b_i$ 4:    $f_i\leftarrow 1$ 5:    ${\mathsf{\Psi }}_i\leftarrow \left\{(B.i_i,B.k_i)\right\}$ 6:    $j\leftarrow i-1$ 7:    while $(j>0 \&\left|B.b_i-B.b_j\right|<\xi )$ do 8:        $s_i\leftarrow (s_i+B.b_j)/2$ 9:        $f_i\leftarrow f_i+1$ 10:        ${\mathsf{\Psi }}_i\leftarrow {\mathsf{\Psi }}_i\cup \left\{(B.i_j,B.k_j)\right\}$ 11:        $j\leftarrow j-1$ 12:    end while 13:    $j\leftarrow i+1$ 14:    while $(j<n \&\left|B.b_i-B.b_j\right|<\xi )$ do 15:        $s_i\leftarrow (s_i+B.b_j)/2$ 16:        $f_i\leftarrow f_i+1$ 17:        ${\mathsf{\Psi }}_i\leftarrow {\mathsf{\Psi }}_i\cup \left\{(B.i_j,B.k_j)\right\}$ 18:        $j\leftarrow j+1$ 19:    end while 20:    $i\leftarrow j$ 21:end while