Papers Graph Matching

Deformable Graph Matching

Graph matching (GM) is a fundamental problem in computer science, and it has been successfully applied to many problems in computer vision. Although widely used, existing GM algorithms cannot incorporate global consisten…

CPN-CORE: A Text Semantic Similarity System Infused with Opinion Knowledge

Stable and Informative Spectral Signatures for Graph Matching

In this paper, we consider the approximate weighted graph matching problem and introduce stable and informative first and second order compatibility terms suitable for inclusion into the popular integer quadratic program…

Seeded Graph Matching

Given two graphs, the graph matching problem is to align the two vertex sets so as to minimize the number of adjacency disagreements between the two graphs. The seeded graph matching problem is the graph matching problem…

A Fast Projected Fixed-Point Algorithm for Large Graph Matching

We propose a fast approximate algorithm for large graph matching. A new projected fixed-point method is defined and a new doubly stochastic projection is adopted to derive the algorithm. Previous graph matching algorithm…

sranjans : Semantic Textual Similarity using Maximal Weighted Bipartite Graph Matching

UNT: A Supervised Synergistic Approach to Semantic Text Similarity

janardhan: Semantic Textual Similarity using Universal Networking Language graph matching

Towards Mediating Shared Perceptual Basis in Situated Dialogue

Efficient Dependency Graph Matching with the IMS Open Corpus Workbench

State-of-the-art dependency representations such as the Stanford Typed Dependencies may represent the grammatical relations in a sentence as directed, possibly cyclic graphs. Querying a syntactically annotated corpus for…

Maximum Margin Multi-Label Structured Prediction

We study multi-label prediction for structured output spaces, a problem that occurs, for example, in object detection in images, secondary structure prediction in computational biology, and graph matching with symmetries…

Face Identification by SIFT-based Complete Graph Topology

This paper presents a new face identification system based on Graph Matching Technique on SIFT features extracted from face images. Although SIFT features have been successfully used for general object detection and reco…

An Integer Projected Fixed Point Method for Graph Matching and MAP Inference

Graph matching and MAP inference are essential problems in computer vision and machine learning. We introduce a novel algorithm that can accommodate both problems and solve them efficiently. Recent graph matching algorit…

Exponential Family Graph Matching and Ranking

We present a method for learning max-weight matching predictors in bipartite graphs. The method consists of performing maximum a posteriori estimation in exponential families with sufficient statistics that encode permut…

Kernels on Attributed Pointsets with Applications

This paper introduces kernels on attributed pointsets, which are sets of vectors embedded in an euclidean space. The embedding gives the notion of neighborhood, which is used to define positive semidefinite kernels on po…