DocumentCode
1739150
Title
Attributed relational graph matching by neural-gas networks
Author
Suganthan, P.N.
Author_Institution
Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore
Volume
1
fYear
2000
fDate
2000
Firstpage
366
Abstract
In the past, the neural-gas (NG) network has been commonly used for clustering, classification and vector quantization of feature vectors. In this paper, a modified NG network is used to perform pattern recognition by matching attributed relational graphs. The ARG matching is formulated as an optimisation problem and the modified NG network is applied to solve it. As every scene vertex is matched to the best matching model vertex, there are some spurious matches in the mapping generated by the NG network. A pose clustering algorithm is used to eliminate these spurious mappings and to estimate the pose parameters. We present experimental results to demonstrate the proposed procedure
Keywords
graph theory; neural nets; pattern clustering; pattern matching; ARG matching; attributed relational graph matching; model vertex; modified NG network; neural-gas networks; optimisation problem; pattern recognition; pose clustering algorithm; pose parameters; scene vertex; Clustering algorithms; Layout; Marine vehicles; NP-hard problem; Parameter estimation; Pattern matching; Pattern recognition; Prototypes; Simulated annealing; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Neural Networks for Signal Processing X, 2000. Proceedings of the 2000 IEEE Signal Processing Society Workshop
Conference_Location
Sydney, NSW
ISSN
1089-3555
Print_ISBN
0-7803-6278-0
Type
conf
DOI
10.1109/NNSP.2000.889428
Filename
889428
Link To Document