On the performance of neuronal matching algorithms
For a solution of the visual correspondence problem we have modified the Self Organizing Map (SOM) to map image planes onto another in a neighborhood- and feature-preserving way. We have investigated the convergence speed of this SOM and Dynamic Link Matching (DLM) on a benchmark problem for the solution of which both algorithms are good candidates. We show that even after careful parameter adjustment the SOM needs a large number of simple update steps and DLM a small number of complicated ones. The results are consistent with an exponential vs. polynomial scaling behavior with increased pattern size. Finally, we present and motivate a rule for adjusting the parameters of DLM for all problem sizes, which we could not find for SOM.
correspondence problem convergence speed dynamic link matching self-organizing map symmetry recognition complexity