
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Antonio RoblesKelly, Edwin R. Hancock, "Graph Edit Distance from Spectral Seriation," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 27, no. 3, pp. 365378, March, 2005.  
BibTex  x  
@article{ 10.1109/TPAMI.2005.56, author = {Antonio RoblesKelly and Edwin R. Hancock}, title = {Graph Edit Distance from Spectral Seriation}, journal ={IEEE Transactions on Pattern Analysis and Machine Intelligence}, volume = {27}, number = {3}, issn = {01628828}, year = {2005}, pages = {365378}, doi = {http://doi.ieeecomputersociety.org/10.1109/TPAMI.2005.56}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Pattern Analysis and Machine Intelligence TI  Graph Edit Distance from Spectral Seriation IS  3 SN  01628828 SP365 EP378 EPD  365378 A1  Antonio RoblesKelly, A1  Edwin R. Hancock, PY  2005 KW  Graph edit distance KW  graph seriation KW  maximum a posteriori probability (MAP) KW  graphspectral methods. VL  27 JA  IEEE Transactions on Pattern Analysis and Machine Intelligence ER   
[1] J.E. Atkins, E.G. Bowman, and B. Hendrickson, “A Spectral Algorithm for Seriation and the Consecutive Ones Problem,” SIAM J. Computing, vol. 28, no. 1, pp. 297310, 1998.
[2] A.D. Bagdanov and M. Worring, “First Order Gaussian Graphs for Efficient Structure Classification,” Pattern Recognition, vol. 36, no. 6, pp. 13111324, 2003.
[3] H. Bunke, “On a Relation between Graph Edit Distance and Maximum Common Subgraph,” Pattern Recognition Letters, vol. 18, no. 8, pp. 689694, 1997.
[4] H. Bunke, A. Munger, and X. Jiang, “Combinatorial Search vs. Genetic Algorithms: A Case Study Based on the Generalized Median Graph Problem,” Pattern Recognition Letters, vol. 20, nos. 1113, pp. 12711279, 1999.
[5] J. Canny, “A Computational Approach to Edge Detection,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 8, no. 6, pp. 679698, Nov. 1986.
[6] W.J. Christmas, J. Kittler, and M. Petrou, “Structural Matching in Computer Vision Using Probabilistic Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 17, no. 8, pp. 749764, Aug. 1995.
[7] F.R.K. Chung, Spectral Graph Theory. Am. Math. Soc., 1997.
[8] E.W. Dijkstra, “A Note on Two Problems in Connection with Graphs,” Numerische Math, vol. 1, pp. 269271, 1959.
[9] C. Dorai and A.K. Jain, “Shape SpectrumBased View Grouping and Matching of 3D FreeForm Objects,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 10, pp. 11391145, Oct. 1997.
[10] M.A. Eshera and K.S. Fu, “A Graph Distance Measure for Image Analysis,” IEEE Trans. Systems, Man, and Cybernetics, vol. 14, pp. 398407, 1984.
[11] A.M. Finch, R.C. Wilson, and E.R. Hancock, “An Energy Function and Continuous Edit Process for Graph Matching,” Neural Computation, vol. 10, no. 7, pp. 18731894, 1998.
[12] S. Gold and A. Rangarajan, “A Graduated Assignment Algorithm for Graph Matching,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 18, no. 4, pp. 377388, Apr. 1996.
[13] G.H. Golub and C.F. Van Loan, Matrix Computations. The Johns Hopkins Press, 1996.
[14] T. Hofmann and M. Buhmann, “Pairwise Data Clustering by Deterministic Annealing,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 1, pp. 114, Jan. 1997.
[15] R. Horaud and H. Sossa, “Polyhedral Object Recognition by Indexing,” Pattern Recognition, vol. 28, no. 12, pp. 18551870, 1995.
[16] B. Huet and E.R. Hancock, “Relational Object Recognition from Large Structural Libraries,” Pattern Recognition, vol. 35, no. 9, pp. 18951915, 2002.
[17] 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, vol. 25, no. 11, pp. 13641379, Nov. 2003.
[18] J.J. Koenderink and A.J. van Doorn, “Surface Shape and Curvature Scales,” Image and Vision Computing, vol. 10, no. 8, pp. 557565, 1992.
[19] V.I. Levenshtein, “Binary Codes Capable of Correcting Deletions, Insertions, and Reversals,” Soviet Physics Doklady, vol. 6, pp. 707710, 1966.
[20] L. Lovász, “Random Walks on Graphs: A Survey,” Bolyai Soc. Math. Studies, vol. 2, no. 2, pp. 146, 1993.
[21] Bin Luo, A.D.J. Cross, and E.R. Hancock, “Corner Detection via Topographic Analysis of VectorPotential,” Pattern Recognition Letters, vol. 20, no. 6, pp. 635650, 1999.
[22] B. Luo and E.R. Hancock, “Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 23, no. 10, pp. 11201136, Oct. 2001.
[23] B. Luo, R.C. Wilson, and E.R. Hancock, “Spectral Embedding of Graphs,” Pattern Recognition, vol. 36, pp. 22132230, 2003.
[24] K.V. Mardia and P.E. Jupp, Directional Statistics. John Wiley & Sons, 2000.
[25] B. Mohar, “Some Applications of Laplace Eigenvalues of Graphs,” Graph Symmetry: Algebraic Methods and Applications, NATO ASI Series C, G. Hahn and G. Sabidussi, eds., pp. 227275, 1997.
[26] R. Myers, R.C. Wilson, and E.R. Hancock, “Bayesian Graph Edit Distance,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 22, no. 6, pp. 628635, June 2000.
[27] Y. PengYeng, “Algorithms for Straight Line Fitting Using KMeans,” Pattern Recognition Letters, vol. 19, pp. 3141, 1998.
[28] A. RoblesKelly and E.R. Hancock, “A Probabilistic Spectral Framework for Spectral Clustering and Grouping,” Pattern Recognition, vol. 37, no. 7, pp. 13871405, 2004.
[29] A. RoblesKelly and E.R. Hancock, “String Edit Distance, Random Walks and Graph Matching,” Int'l J. Pattern Recognition and Artificial Intelligence, vol. 18, no. 3, pp. 315327, 2004.
[30] A. RoblesKelly, S. Sarkar, and E.R. Hancock, “A Fast Leading Eigenvector Approximation for Segmentation and Grouping,” Proc. Int'l Conf. Pattern Recognition, pp. 639642, 2002.
[31] A. Sanfeliu and K.S. Fu, “A Distance Measure between Attributed Relational Graphs for Pattern Recognition,” IEEE Trans. Systems, Man, and Cybernetics, vol. 13, no. 353362, 1983.
[32] G. Scott and H. LonguetHiggins, “An Algorithm for Associating the Features of Two Images,” Proc. Royal Soc. London, no. 244 in B, pp. 2126, 1991.
[33] B. Selman, H.A. Kautz, and B. Cohen, “Noise Strategies for Improving Local Search,” Proc. 12th Nat'l Conf. Artificial Intelligence, pp. 337343, 1994.
[34] L.G. Shapiro and R.M. Haralick, “Relational Models for Scene Analysis,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 4, pp. 595602, 1982.
[35] L.S. Shapiro and J.M. Brady, “A Modal Approach to FeatureBased Correspondence,” Proc. British Machine Vision Conf., pp. 7885, 1991.
[36] A. Shokoufandeh, S.J. Dickinson, K. Siddiqi, and S.W. Zucker, “Indexing Using a Spectral Encoding of Topological Structure,” Proc. Computer Vision and Pattern Recognition, pp. 491497, 1998.
[37] O. Steinmann, A. Strohmaier, and T. Stutzle, “Tabu Search vs. Random Walk,” Proc. Advances in Artificial Intelligence (KI '97), pp. 337348, 1997.
[38] G.W. Stewart and J.G. Sun, Matrix Perturbation Theory. Academic Press, 1990.
[39] M. Tuceryan and T. Chorzempa, “Relative Sensitivity of a Family of ClosestPoint Graphs in Computer Vision Applications,” Pattern Recognition, vol. 24, no. 5, pp. 361373, 1991.
[40] S. Umeyama, “An Eigen Decomposition Approach to Weighted Graph Matching Problems,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 10, no. 5, pp. 695703, Sept. 1988.
[41] R.S. Varga, Matrix Iterative Analysis, second ed. Springer, 2000.
[42] R.A. Wagner and M.J. Fisher, “The StringtoString Correction Problem,” J. ACM, vol. 21, no. 1, pp. 168173, 1974.
[43] R.C. Wilson and E.R. Hancock, “A Bayesian Compatibility Model for Graph Matching,” Pattern Recognition Letters, vol. 17, pp. 263276, 1996.
[44] R.C. Wilson and E.R. Hancock, “Structural Matching by Discrete Relaxation,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 19, no. 6, pp. 634648, June 1997.
[45] P.L. Worthington and E.R. Hancock, “New Constraints on DataCloseness and Needle Map Consistency for ShapeFromShading,” IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 21, no. 12, pp. 12501267, Dec. 1999.