Binary Constraint Preserving Graph Matching

Abstract

Graph matching is a fundamental problem in computer vision and pattern recognition area. In general, it can be formulated as an Integer Quadratic Programming (IQP) problem. Since it is NP-hard, approximate relaxations are required. In this paper, a new graph matching method has been proposed. There are three main contributions of the proposed method: (1) we… (More)
DOI: 10.1109/CVPR.2017.66

4 Figures and Tables

Topics

  • Presentations referencing similar topics