𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the performance of neuronal matching algorithms

✍ Scribed by Rolf P Würtz; Wolfgang Konen; Kay-Ole Behrmann

Book ID
104348925
Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
280 KB
Volume
12
Category
Article
ISSN
0893-6080

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 SIMILAR VOLUMES

Assessing the performance of matching al
Assessing the performance of matching algorithms when selection into treatment is strong
✍ Boris Augurzky; Jochen Kluve 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 190 KB

## Abstract This paper investigates the method of matching regarding two crucial implementation choices: the distance measure and the type of algorithm. We implement optimal full matching—a fully efficient algorithm—and present a framework for statistical inference. The implementation uses data fro

On the performance of peeling algorithms
On the performance of peeling algorithms
✍ Petitjean, Michel ;Saporta, Gilbert 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 453 KB

## Abstract The peeling of a __d__‐dimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worst‐case convex hull algorithm, known to have an __O__(__n__^˙^ Log (n)) execution time, may give an __O__(__n__^˙^__n__^˙^ Log (n)) to peel all the set;

Lana–Match algorithm: a parallel version
Lana–Match algorithm: a parallel version of the Rete–Match algorithm
✍ Mostafa M Aref; Mohammed A Tayyib 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 220 KB

The Rete-Match algorithm is a matching algorithm used to develop production systems. Although this algorithm is the fastest known algorithm, for many patterns and many objects matching, it still suffers from considerable amount of time needed due to the recursive nature of the problem. In this paper