Geometric latent Dirichlet allocation on a matching graph for large-scale image datasets

DOI10.1007/S11263-010-0363-5zbMATH Open1235.68282OpenAlexW2024047694MaRDI QIDQ409122FDOQ409122

Josef Sivic, Andrew Zisserman, James Philbin

Publication date: 12 April 2012

Published in: International Journal of Computer Vision (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01064717/file/Philbin_ijcv2011.pdf

Recommendations

• Image labeling based on graphical models using Wasserstein messages and geometric assignment
• Image classification based on the Laplacian matrix of graphs and non-negative matrix factorization
• Multilinear Graph Embedding: Representation and Regularization for Images
• Similarity learning for graph-based image representations
• Exact \(k\)-component graph learning for image clustering
• Image Segmentation via Probabilistic Graph Matching
• GraphBPT: an efficient hierarchical data structure for image representation and probabilistic inference

zbMATH Keywords

large-scale retrievalobject discoverytopic/generative models

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)

Cites Work

• 10.1162/jmlr.2003.3.4-5.993
• Title not available (Why is that?)
• Unsupervised learning by probabilistic latent semantic analysis
• Geometric latent Dirichlet allocation on a matching graph for large-scale image datasets
• Title not available (Why is that?)
• Computer Vision - ECCV 2004

Cited In (3)

• Geometric latent Dirichlet allocation on a matching graph for large-scale image datasets
• Graph matching by simplified convex-concave relaxation procedure
• 10.1162/153244303322533214

Uses Software

• SIFT

This page was built for publication: Geometric latent Dirichlet allocation on a matching graph for large-scale image datasets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409122)