2019
DOI: 10.1016/j.is.2018.04.002
|View full text |Cite
|
Sign up to set email alerts
|

Searching for variable-speed motions in long sequences of motion capture data

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
21
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
4
3
1

Relationship

2
6

Authors

Journals

citations
Cited by 20 publications
(21 citation statements)
references
References 21 publications
0
21
0
Order By: Relevance
“…By comparing the recognition rates of high‐level descriptors and PMI high‐level descriptors under the same dictionary size, the conclusion is drawn that our proposed algorithm is superior to the semantic similarity calculation method based on, and the recognition rate is increased by 0.67% on average. In addition, by comparing the recognition rates of high‐level descriptors and PMI high‐level descriptors [19] under the same dictionary size, the same conclusion is drawn that the near‐semantic visual dictionary generation algorithm proposed in this chapter is superior to the PPM‐based high‐level descriptors in recognition rate, which increases the average recognition rate by 2.09%.…”
Section: Simulation and Results Analysismentioning
confidence: 64%
“…By comparing the recognition rates of high‐level descriptors and PMI high‐level descriptors under the same dictionary size, the conclusion is drawn that our proposed algorithm is superior to the semantic similarity calculation method based on, and the recognition rate is increased by 0.67% on average. In addition, by comparing the recognition rates of high‐level descriptors and PMI high‐level descriptors [19] under the same dictionary size, the same conclusion is drawn that the near‐semantic visual dictionary generation algorithm proposed in this chapter is superior to the PPM‐based high‐level descriptors in recognition rate, which increases the average recognition rate by 2.09%.…”
Section: Simulation and Results Analysismentioning
confidence: 64%
“…Most existing works that process continuous 3D skeleton sequences in an unsupervised way focus on subsequence search [18], unsupervised segmentation [8], or anticipating future actions based on the past-to-current data [4]. In [18], the continuous sequences are synthetically partitioned into a lot of overlapping and variable-size segments that are represented by 4, 096D deep features. However, indexing a large number of such very high-dimensional features is costly.…”
Section: Related Work and Our Contributionsmentioning
confidence: 99%
“…Just as content-based image retrieval (CBIR) [ 17 ], feature extraction and similarity measure are two most important parts in CBMR. Although the query example of CBIR is commonly accepted as a single image, query example in the QBE systems of CBMR can be found in various forms, such as a single 3D pose [ 3 ], strictly aligned motion clip [ 6 , 7 ], slightly misaligned motion clip [ 18 ], depending on their different assumptions on the boundaries of motion clip. It can be seen that most of the current CBMR methods impose additional constraints on query examples, regardless the fact that obtaining 3D query examples of motion is hard for users.…”
Section: Related Workmentioning
confidence: 99%