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

DOI10.1007/S11263-010-0363-5zbMath1235.68282OpenAlexW2024047694MaRDI QIDQ409122

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

zbMATH Keywords

large-scale retrievalobject discoverytopic/generative models

Mathematics Subject Classification ID

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

Related Items (2)

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

Uses Software

• SIFT

Cites Work

• Unnamed Item
• Unnamed Item
• Geometric latent Dirichlet allocation on a matching graph for large-scale image datasets
• 10.1162/jmlr.2003.3.4-5.993
• Computer Vision - ECCV 2004
• Unsupervised learning by probabilistic latent semantic analysis

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