The pyramid match kernel: efficient learning with sets of features
From MaRDI portal
Publication:3174096
Recommendations
Cited in
(20)- Neural bag-of-features learning
- Graph kernels: a survey
- Large-scale Gaussian process inference with generalized histogram intersection kernels for visual recognition tasks
- Explicit embeddings for nearest neighbor search with Mercer kernels
- Bi-space pyramid match kernel for image object classification
- Machine Learning: ECML 2004
- Understanding and improving kernel local descriptors
- Blasso for object categorization and retrieval: towards interpretable visual models
- Gaussian processes for object categorization
- Fast PRISM: branch and bound Hough transform for object class detection
- Learning semantic representations of objects and their parts
- scientific article; zbMATH DE number 2062484 (Why is no real title available?)
- 10.1162/1532443041827934
- Efficient multi-modal fusion on supergraph for scalable image annotation
- Discriminative compact pyramids for object and scene recognition
- Parameter estimation in image processing and computer vision
- Incremental linear discriminant analysis using sufficient spanning sets and its applications
- Large scale image annotation: learning to rank with joint word-image embeddings
- Learning Binary Hash Codes for Large-Scale Image Search
- Learning Theory
This page was built for publication: The pyramid match kernel: efficient learning with sets of features
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3174096)
