The pyramid match kernel: efficient learning with sets of features
From MaRDI portal
Publication:3174096
zbMATH Open1222.68206MaRDI QIDQ3174096FDOQ3174096
Authors: Kristen Grauman, Trevor Darrell 
Publication date: 12 October 2011
Full work available at URL: http://www.jmlr.org/papers/v8/grauman07a.html
Recommendations
kernelapproximate matchingobject recognitionhistogram intersectionmulti-resolution histogram pyramidsets of features
Cited In (20)
- 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
- 10.1162/1532443041827934
- Title not available (Why is that?)
- Learning semantic representations of objects and their parts
- Learning Binary Hash Codes for Large-Scale Image Search
- Explicit embeddings for nearest neighbor search with Mercer kernels
- Learning Theory
- Bi-space pyramid match kernel for image object classification
- Efficient multi-modal fusion on supergraph for scalable image annotation
- Parameter estimation in image processing and computer vision
- Graph kernels: a survey
- Large-scale Gaussian process inference with generalized histogram intersection kernels for visual recognition tasks
- Neural bag-of-features learning
- Large scale image annotation: learning to rank with joint word-image embeddings
- Discriminative compact pyramids for object and scene recognition
- Understanding and improving kernel local descriptors
- Machine Learning: ECML 2004
- Incremental linear discriminant analysis using sufficient spanning sets and its applications
Uses Software
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)
