2018
DOI: 10.1007/978-3-319-93000-8_28
|View full text |Cite
|
Sign up to set email alerts
|

Shape Classification Using Hilbert Space Embeddings and Kernel Adaptive Filtering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…In the case of AFs, they allow recursive learning of the time series, giving prominence to the most relevant data samples [ 29 ]. However, the quantization size and the error tolerance must be tuned appropriately, which can be problematic for 3D skeletal-based samples [ 30 ]. Regarding the GP-based methods, a Bayesian representation of time series is carried out.…”
Section: Introductionmentioning
confidence: 99%
“…In the case of AFs, they allow recursive learning of the time series, giving prominence to the most relevant data samples [ 29 ]. However, the quantization size and the error tolerance must be tuned appropriately, which can be problematic for 3D skeletal-based samples [ 30 ]. Regarding the GP-based methods, a Bayesian representation of time series is carried out.…”
Section: Introductionmentioning
confidence: 99%