Point feature matching adopting Walsh transform

This paper introduces a new method to solve the problem of matching correspondent feature points across two images containing a moving rigid object. Two successive time-varying images are used. Edge points are first extracted using a 3x3 Laplacian mask, Walsh transformation is then applied to the feature paints in both images. The choice of Walsh transformation in contrast to other orthogonal transforms is a direct result of its computational simplicity and its interpretative meaning in terms of information contained in the spatial domain. Two premises are applied as matching rules. The first involves the speed of object and imaging system, while the other involves the selection of the best match from the set of candidate matches. Unlike other matching techniques, the computational complexity of the proposed technique does not grow up with to the number of detected feature points in either of the two images. This characteristic gives the technique a great flexibility. Experimental results are given and assessed in terms of bath accuracy and computational complexity.