2019
DOI: 10.1007/s10489-019-01538-w
|View full text |Cite
|
Sign up to set email alerts
|

A fast and accurate explicit kernel map

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 27 publications
0
2
0
Order By: Relevance
“…Remarkably, the RFF-FCN and RFF-Unet achieve the best ranking (first and second place) for Dice and IOU, which are often used to test semantic segmentation tasks. Then, our kernel approach allows preserving a trade-off between network complexity and representation learning capability [34,36].…”
Section: Semantic Segmentation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Remarkably, the RFF-FCN and RFF-Unet achieve the best ranking (first and second place) for Dice and IOU, which are often used to test semantic segmentation tasks. Then, our kernel approach allows preserving a trade-off between network complexity and representation learning capability [34,36].…”
Section: Semantic Segmentation Resultsmentioning
confidence: 99%
“…The fundamental work in [34] introduces the random Fourier features (RFF) estimator founded on Bochner's theorem for stationary kernels [35]. The RFF approach tackles the issues of significant computational and storage cost of kernel matrices [36]. In addition, some RFF variants (most of them approximating a Gaussianbased mapping) have been proposed to improve the computational cost and learning performance.…”
Section: Introductionmentioning
confidence: 99%