The pyramid match kernel: efficient learning with sets of features

zbMATH Open1222.68206MaRDI QIDQ3174096FDOQ3174096

Kristen Grauman, Trevor Darrell

Publication date: 12 October 2011

Full work available at URL: http://www.jmlr.org/papers/v8/grauman07a.html

Recommendations

• Bi-space pyramid match kernel for image object classification
• Kernel Methods in Computer Vision
• 10.1162/1532443041827934
• Kernel matching pursuit
• Large scale multiple kernel learning

zbMATH Keywords

kernelapproximate matchingobject recognitionhistogram intersectionmulti-resolution histogram pyramidsets of features

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited In (15)

• 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
• Graph Kernels: A Survey
• Parameter Estimation in Image Processing and Computer Vision
• 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
• Efficient multi-modal fusion on supergraph for scalable image annotation
• Large-scale Gaussian process inference with generalized histogram intersection kernels for visual recognition tasks
• Large scale image annotation: learning to rank with joint word-image embeddings
• Incremental linear discriminant analysis using sufficient spanning sets and its applications

Uses Software

• PCA-SIFT
• EMD

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)