Pseudo-inverse with increasing threshold: an error-recovery pattern recognition algorithm

A pseudo-inverse algorithm with an increasing threshold value for pattern recognition is presented. This method is particularly useful when the original matrix is not a square matrix. The algorithm and its implementation are studied. Using English capital letters as samples, the error-recovery capability of the proposed algorithm is observed to be better than that of the fixed threshold algorithm. Noisy patterns with 20% errors, i.e., 12 in Hamming distance, can be recognized using this approach.<
>