메뉴 건너뛰기




Volumn 12, Issue 1, 1999, Pages 127-134

On the performance of neuronal matching algorithms

Author keywords

Complexity; Convergence speed; Correspondence problem; Dynamic link matching; Self organizing map; Symmetry recognition

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING;

EID: 0344096749     PISSN: 08936080     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0893-6080(98)00112-9     Document Type: Article
Times cited : (4)

References (15)
  • 1
    • 0344283003 scopus 로고
    • Leistungsuntersuchungen des 'Dynamischen Link-Matchings' und Vergleich mit dem Kohonen-Algorithmus
    • Ruhr-Universitat Bochum; Master's Thesis, Universität Karlsruhe
    • Behrmann, K.-O. (1993). Leistungsuntersuchungen des 'Dynamischen Link-Matchings' und Vergleich mit dem Kohonen-Algorithmus. Technical Report IR-INI 93-05, Ruhr-Universitat Bochum; Master's Thesis, Universität Karlsruhe.
    • (1993) Technical Report IR-INI 93-05
    • Behrmann, K.-O.1
  • 3
    • 0010725280 scopus 로고
    • Quantifying neighborhood preservation in topographic mappings
    • Institute for Neural Computation, UCSD, La Jolla, CA 92037, USA.
    • Goodhill, G.J., Finch, S., and Sejnowski, T.J. (1995). Quantifying neighborhood preservation in topographic mappings. Technical Report INC-9505. Institute for Neural Computation, UCSD, La Jolla, CA 92037, USA.
    • (1995) Technical Report INC-9505.
    • Goodhill, G.J.1    Finch, S.2    Sejnowski, T.J.3
  • 4
    • 0020068152 scopus 로고
    • Self-organized formation of topologically correct feature maps
    • Kohonen, T. (1982). Self-organized formation of topologically correct feature maps. Biological Cybernetics, 43, 59-69.
    • (1982) Biological Cybernetics , vol.43 , pp. 59-69
    • Kohonen, T.1
  • 5
    • 0025489075 scopus 로고
    • The self-organizing map
    • Kohonen, T. (1990). The self-organizing map. Proc. IEEE, 78, 1464-1480.
    • (1990) Proc. IEEE , vol.78 , pp. 1464-1480
    • Kohonen, T.1
  • 7
    • 0000053445 scopus 로고
    • Learning to generalize from single examples in the dynamic link architecture
    • Konen, W., & von der Malsburg, C. (1993). Learning to generalize from single examples in the dynamic link architecture. Neural Computation, 5, 719-735.
    • (1993) Neural Computation , vol.5 , pp. 719-735
    • Konen, W.1    Von Der Malsburg, C.2
  • 8
    • 0028563265 scopus 로고
    • A fast dynamic link matching algorithm for invariant pattern recognition
    • Konen, W., Maurer, T., & von der Malsburg, C. (1994). A fast dynamic link matching algorithm for invariant pattern recognition. Neural Networks, 7(6), 1019-1030.
    • (1994) Neural Networks , vol.7 , Issue.6 , pp. 1019-1030
    • Konen, W.1    Maurer, T.2    Von Der Malsburg, C.3
  • 10
    • 0011347548 scopus 로고
    • Learning symmetry groups with hidden units: Beyond the perceptron
    • Sejnowski, T., Kienker, P., & Hinton, G. (1986). Learning symmetry groups with hidden units: beyond the perceptron. Physica D, 22, 260-275.
    • (1986) Physica D , vol.22 , pp. 260-275
    • Sejnowski, T.1    Kienker, P.2    Hinton, G.3
  • 14
    • 33646116622 scopus 로고
    • Multilayer dynamic link networks for establishing image point correspondences and visual object recognition
    • Thun, Frankfurt am Main: Verlag Harri Deutsch.
    • Würtz, R.P. (1995). Multilayer dynamic link networks for establishing image point correspondences and visual object recognition. In Reihe Physik (Vol. 41). Thun, Frankfurt am Main: Verlag Harri Deutsch.
    • (1995) Reihe Physik , vol.41
    • Würtz, R.P.1
  • 15
    • 0031192983 scopus 로고    scopus 로고
    • Object recognition robust under translations, deformations and changes in background
    • Würtz, R.P. (1997). Object recognition robust under translations, deformations and changes in background. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19 (7), 769-775.
    • (1997) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.19 , Issue.7 , pp. 769-775
    • Würtz, R.P.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.