Motion retrieval using weighted graph matching

Verfasser / Beitragende:
[Qinkun Xiao, Yi Wang, Haiyun Wang]
Ort, Verlag, Jahr:
2015
Enthalten in:
Soft Computing, 19/1(2015-01-01), 133-144
Format:
Artikel (online)
ID: 605468443
LEADER caa a22 4500
001 605468443
003 CHVBK
005 20210128100316.0
007 cr unu---uuuuu
008 210128e20150101xx s 000 0 eng
024 7 0 |a 10.1007/s00500-014-1237-5  |2 doi 
035 |a (NATIONALLICENCE)springer-10.1007/s00500-014-1237-5 
245 0 0 |a Motion retrieval using weighted graph matching  |h [Elektronische Daten]  |c [Qinkun Xiao, Yi Wang, Haiyun Wang] 
520 3 |a In this paper, we propose a content-based motion retrieval (CBMR) algorithm, where many-to-many matching method, weighted graph matching, is employed for comparison between two motions. Our novel points can be described as: (1) A selection approach of representative frames (RF) is presented, in this work, each motion is represented by a set of sequence frames, representative frames are first selected from the motions based on Fuzzy clustering and the corresponding initial weights are provided. (2) The RF-based weighted graph model (RF-WGM) is constructed, and a revised KM (Kuhn-Munkres) algorithm is used to solve maximum matching problem of weighted graph. The RF-WGM matching result is used to measure the similarity between two motions. Experimental results and comparison with existing methods show the effectiveness of the proposed algorithm. 
540 |a Springer-Verlag Berlin Heidelberg, 2014 
690 7 |a CBMR  |2 nationallicence 
690 7 |a RF-WGM  |2 nationallicence 
690 7 |a Revised KM algorithm  |2 nationallicence 
700 1 |a Xiao  |D Qinkun  |u Department of Electronics Information Engineering, Xi'an Technological University, 710032, Xi'an, China  |4 aut 
700 1 |a Wang  |D Yi  |u Department of Electronics Information Engineering, Xi'an Technological University, 710032, Xi'an, China  |4 aut 
700 1 |a Wang  |D Haiyun  |u STMicroelectronics R&D of Asia-Pacific, 554574, Singapore, Singapore  |4 aut 
773 0 |t Soft Computing  |d Springer Berlin Heidelberg  |g 19/1(2015-01-01), 133-144  |x 1432-7643  |q 19:1<133  |1 2015  |2 19  |o 500 
856 4 0 |u https://doi.org/10.1007/s00500-014-1237-5  |q text/html  |z Onlinezugriff via DOI 
898 |a BK010053  |b XK010053  |c XK010000 
900 7 |a Metadata rights reserved  |b Springer special CC-BY-NC licence  |2 nationallicence 
908 |D 1  |a research-article  |2 jats 
949 |B NATIONALLICENCE  |F NATIONALLICENCE  |b NL-springer 
950 |B NATIONALLICENCE  |P 856  |E 40  |u https://doi.org/10.1007/s00500-014-1237-5  |q text/html  |z Onlinezugriff via DOI 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Xiao  |D Qinkun  |u Department of Electronics Information Engineering, Xi'an Technological University, 710032, Xi'an, China  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Wang  |D Yi  |u Department of Electronics Information Engineering, Xi'an Technological University, 710032, Xi'an, China  |4 aut 
950 |B NATIONALLICENCE  |P 700  |E 1-  |a Wang  |D Haiyun  |u STMicroelectronics R&D of Asia-Pacific, 554574, Singapore, Singapore  |4 aut 
950 |B NATIONALLICENCE  |P 773  |E 0-  |t Soft Computing  |d Springer Berlin Heidelberg  |g 19/1(2015-01-01), 133-144  |x 1432-7643  |q 19:1<133  |1 2015  |2 19  |o 500