2017
DOI: 10.1016/j.jvlc.2017.09.001
|View full text |Cite
|
Sign up to set email alerts
|

Behavioral segmentation for human motion capture data based on graph cut method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
11
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 18 publications
(11 citation statements)
references
References 14 publications
0
11
0
Order By: Relevance
“…At first, we perform segmentation experiments on Subject 86 dataset and we also do contrast experiments using TMM [11], Nystrom [12], HACA [7], ACA [2] and GMM [6] method. As shown in Fig.…”
Section: Experiments Results and Analysesmentioning
confidence: 99%
See 2 more Smart Citations
“…At first, we perform segmentation experiments on Subject 86 dataset and we also do contrast experiments using TMM [11], Nystrom [12], HACA [7], ACA [2] and GMM [6] method. As shown in Fig.…”
Section: Experiments Results and Analysesmentioning
confidence: 99%
“…This method requires no interaction for the segmentation. Yu et al [12] deal with the human motion segmentation problem based on graph partition method. They construct an undirected weighted graph according to motion data and apply the t-nearest neighbors and Nystrom method for clustering motion data to finish motion segmentation.…”
Section: B Methods Based On Statistical Characteristicsmentioning
confidence: 99%
See 1 more Smart Citation
“…However, there are some phenomena that the division point is increased, lost, or erroneous on different motion data sequences. Yu et al 13 have recently proposed the t-nearest and Nyström algorithm based on the graph cut, and the segmentation effect is ideal. As shown in Table 2, our algorithm is only better than t-nearest in the recall indicator, whereas the other indicators are slightly worse, but the results are very close.…”
Section: Experiments Analysismentioning
confidence: 99%
“…The retrieved sets of similar frames are then ranked in temporal order to identify queryrelevant subsequences [26]. Since searching in frame-based features needn't be so effective, the segment-based features are extracted from overlapping [25] or disjoint [28] segments, which are detected in an unsupervised way [13,37] from both the long motion and query. To identify query-relevant segments, sequential search can be used, such as the A-LTK method in [9] or string-matching-based algorithm in [5].…”
Section: Similarity Searchingmentioning
confidence: 99%