Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph

DOI10.1007/978-3-030-14085-4_18OpenAlexW2915763563MaRDI QIDQ5237062

Cong Rao, Longin Jan Latecki, Yi Fan, Kaile Su

Publication date: 16 October 2019

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10072/401661

zbMATH Keywords

local search algorithmmaximum weight cliquecommon object discoveryvisual similarity

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• MS-COCO
• PASCAL VOC
• Faster R-CNN

Cites Work

• Solving the maximum edge weight clique problem via unconstrained quadratic programming
• Approximating the maximum vertex/edge weighted clique using local search
• A nonconvex quadratic optimization approach to the maximum edge weight clique problem
• Deep metric learning using triplet network
• Solving the maximum edge-weight clique problem in sparse graphs with compact formulations

This page was built for publication: Common Object Discovery as Local Search for Maximum Weight Cliques in a Global Object Similarity Graph