Very fast dynamic programming-based parallel algorithm for aerial image matching

A parallel algorithm of O(N) complexity, N number of compared pixels, for image matching, based on the dynamic programming principle, is addressed. Its new correlation (cost) function evaluates images similarity very precisely. Running time of the proposed parallel algorithm on a bi-SPARC 20/60 workstation is provided.

[1]  Kai Hwang,et al.  Advanced computer architecture - parallelism, scalability, programmability , 1992 .

[2]  Daniel P. Huttenlocher,et al.  Comparing Images Using the Hausdorff Distance , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Gunilla Borgefors,et al.  Distance transformations in digital images , 1986, Comput. Vis. Graph. Image Process..

[4]  Edwige E. Pissaloux,et al.  Parallel method for matching of aerial images , 1996, Other Conferences.

[5]  G. M. Quenot.  The 'orthogonal algorithm' for optical flow detection using dynamic programming , 1992, [Proceedings] ICASSP-92: 1992 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[6]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .

[7]  E. Pissaloux,et al.  A guided image matching approach using Hausdorff distance with interesting points detection , 1994, Proceedings of 1st International Conference on Image Processing.