Graph seriation using semi-definite programming

Authors:
Hang Yu;Edwin R. Hancock
Affiliations:
Department of Computer Science, University of York, UK;Department of Computer Science, University of York, UK
Venue:
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Year:
2005

Citing 8
Cited 1

An Eigendecomposition Approach to Weighted Graph Matching Problems

IEEE Transactions on Pattern Analysis and Machine Intelligence
Feature-based correspondence: an eigenvector approach

Image and Vision Computing - Special issue: BMVC 1991
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Semidefinite programming

SIAM Review
A Spectral Algorithm for Seriation and the Consecutive Ones Problem

SIAM Journal on Computing
Semidefinite programming relaxations for the graph partitioning problem

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming

IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph Edit Distance from Spectral Seriation

IEEE Transactions on Pattern Analysis and Machine Intelligence

Semidefinite Programming Heuristics for Surface Reconstruction Ambiguities

ECCV '08 Proceedings of the 10th European Conference on Computer Vision: Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph seriation is concerned with placing the nodes of a graph in a serial order so that edge consecutive constraints are generally preserved. It is an important task in network analysis problem in routine and bioinformatics. In this paper we show how the problem of graph seriation can be solved using semi-definite programming (SDP). This is a convex optimisation procedure that has recently found widespread use in computer vision. The main contribution of the paper is to detail the matrix representation needed to cast the graph-seriation problem in a matrix setting so that it can be solved using SDP. We illustrate the utility of the method for graph-matching and graph-clustering, where it is shown to offer advantages to the graph-spectral approach to seriation.