Graph seriation using semi-definite programming

Lecture Notes in Computer Science

Volumn 3434, Issue , 2005, Pages 63-71

  Yu, Hang ^a   Hancock, Edwin R ^a  

^a UNIVERSITY OF YORK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; ELECTRIC NETWORK ANALYSIS; MATHEMATICAL PROGRAMMING; MATRIX ALGEBRA; PROBLEM SOLVING;

BIOINFORMATICS; GRAPH CLUSTERING; GRAPH-SPECTRAL APPROACH; SEMI-DEFINITE PROGRAMMING;

GRAPH THEORY;

EID: 24644487066     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31988-7_7     Document Type: Conference Paper

References (17)

1. A.Robles-Kelly and E.R.Hancock. Graph matching using spectral seriation. Energy Minimisation Methods in Computer Vision and Pattern Recognition, pages 517-532, 2003.
2. A.Robles-Kelly and E.R.Hancock. Graph Edit Distance from Spectral Seriation. IEEE Transactions on Pattern Analysis and Machine Intelligence, To appear, 2004.
3. C.Schellewald and C.Schnorr. Subgraph Matching with Semidefinite Programming. Proceedings IWCIA (International Workshop on Combinatorial Image Analysis), Palermo, Italy, 2003.
4. F.Alizaheh. Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim, 5:13-51, 1995.
5. G.Scott and H.Longuet-Higgins. An algorithm for associating the features of two images. Proceedings of Royal Society of London Series, 244:21-26, 1991.
6. Henry Wolkowicz and Qing Zhao. Semidefinite Programming relaxation for the graph partitioning problem. Discrete Appl. Math, pages 461-479, 1999.
7. J.Keuchel,C.Schnorr,C.Schellewald,and D.Cremers. Binary Partitioning, Perceptual Grouping, and Restoration with Semidefinite Programming. IEEE Trans. Pattern Analysis and Machine Intelligence, 25(11):1364-1379, 2003.
8. Jonathan E. Atkins, Erik G. Boman and Bruce Hendrickson. A Spectral Algorithm for Seriation and the Consecutive Ones Problem. SIAM Journal on Computing, 28(1):297-310, 1998.
9. K.Fujisawa,Y.Futakata,M.Kojima,K.Nakata and M.Yamashita. Sdpa-m user's manual, http://sdpa.is.titech.ac.jp/SDPA-M.
10. L.S.Shapiro and J.M.Brady. Feature-based correspondence-an eigenvector approach. Image and Vision Computing, 10:283-288, 1992.
11. L.Vandenberghe and S.Boyd. Semidefinite Programming. SIAM Review, 38(1):49-95, 1996.
12. M.Veldhorst. Approximation of the consecutive one matrix augmentation problem. J. Comput., 14:709-729, 1985.
13. M.X.Goemans and D.P.WIlliamson. Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming. J.ACM, 42(6):1115-1145, 1995.
14. Fan R.K.Chung. Spectral Graph Theory. AMS, 1997.
15. Umeyama. S. An eigendecomposition approach to weighted graph matching problems. IEEE Trans. PAMI, 10(5):695-703, 1988.
16. S.K.Nayar S.A.Nene and H.Murase. Columbia object image library (coil-100). Technical Report, CUCS-006-96, 1996.
17. T.F.Cox and M.A.A.Cox. Multidimensional scaling. Chapman and Hall, 1993.