atlas

Research map / Graph learning / Graph algorithms and clustering

Guided Similarity Separation for Image Retrieval

NeurIPS 2019 · Graph learning › Graph algorithms and clustering · approach: Graph embedding and spectral sparsification · 26 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Add spatial verification when building the training adjacency matrix (GSSV vs GSS) (ablation)GeM+GSS · ROxford HardmAP: 57.5 -> 62.2Helped
Add spatial verification at query time on top of GSSV (ablation)GeM+GSSV · ROxford HardmAP: 62.2 -> 64.7Helped
Add spatial verification at query time on top of GSSV (ablation)GeM+GSSV · RParis HardmAP: 85.3 -> 85.3No clear effect
Replace GeM descriptors with GSS (GCN neighbor encoding plus pairwise separation loss)GeM · ROxford HardmAP: 38.5 -> 57.5Helped
GSS vs best similarity propagation baseline (GeM+DSM+DFS)GeM · RParis HardmAP: 79.3 -> 83.5Helped
Spatial verification at query time costs more inference time for more candidates (ablation)GSSV-SV · ROxford Hardrun-time overhead: over 70% increase in run-timeHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy