• Opto-Electronic Engineering
  • Vol. 38, Issue 12, 137 (2011)
LENG Cheng-cai1、*, XU Wei1, YAN Wei-dong1, and HE Li2
Author Affiliations
  • 1[in Chinese]
  • 2[in Chinese]
  • show less
    DOI: 10.3969/j.issn.1003-501x.2011.12.026 Cite this Article
    LENG Cheng-cai, XU Wei, YAN Wei-dong, HE Li. Image Registration Based on Non-negative Matrix Factorization of Graph[J]. Opto-Electronic Engineering, 2011, 38(12): 137 Copy Citation Text show less
    References

    [1] Ardeshir Goshtashy A. 2-D and 3-D Image Registration for Medical, Remote Sensing, and Industrial Applications [M]. Hoboken, New Jersey: John Wiley & Sons, Inc, 2005.

    [2] Zitová B, Flusser J. Image Registration Methods: a Survey [J]. Image and Vision Computing(S0262-8856), 2003, 21(11): 977-1000.

    [3] Fan Chung R K. Spectral Graph Theory [M]. Providence, RI: American Mathematical Society, 1997.

    [4] Umeyama S. An Eigendecomposition Approach to Weighted Graph Matching Problems [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence(S0162-8828), 1988, 10(5): 695-703.

    [5] Scott G L, Longuet-Higgins H C. An Algorithm for Associating the Features of Two Images [J]. Proceedings of the Royal Society London Series B(S0962-8452), 1991, 244(1309): 21-26.

    [6] Shapiro L S, Brady J M. Feature-based Correspondence-an Eigenvector Approach [J]. Image and Vision Computing(S0262-8856), 1992, 10(5): 283-288.

    [7] Grady L. Random Walks for Image Segmentation [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence(S0162-8828), 2006, 28(11): 1-17.

    [8] Caelli T, Kosinov S. An Eigenspace Projection Clustering Method for Inexact Graph Matching [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence(S0162-8828), 2004, 26(4): 515-519.

    [9] Raveaux R, Burie J C, Ogier J M. A Graph Matching Method and a Graph Matching Distance Based on Subgraph Assignments [J]. Pattern Recognition Letters(S0167-8655), 2010, 31(5): 394-406.

    [10] Leng C C, Tian Z, Li J, et al. Image Registration Based on Matrix Perturbation Analysis Using Spectral Graph [J]. Chinese Optics Letters(S1671-7694), 2009, 7(11): 996-1000.

    [12] Silletti A, Abate A, Axelrod J D, et al. Versatile Spectral Methods for Point Set Matching [J]. Pattern Recognition Letters(S0167-8655), 2011, 32(5): 731-739.

    [13] Sch.lkopf B, Smola A, Müller K R. Nonlinear Component Analysis as a Kernel Eigenvalue Problem [J]. Neural Computation(S0899-7667), 1998, 10(5): 1299-1319.

    [14] Tenenbaum J, Silva V de, Langford J. A Global Geometric Framework for Nonlinear Dimensionality Reduction [J]. Science(S0036-8075), 2000, 290(5500): 2319-2323.

    [15] Roweis S, Saul L. Nonlinear Dimensionality Reduction by Locally Linear Embedding [J]. Science(S0036-8075), 2000, 290(5500): 2323-2326.

    [16] Belkin M, Niyogi P. Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering [C]// In Advances in Neural Information Processing Systems, Vancouver, Canada, Dec 3-8, 2001, 14: 585-591.

    [17] Deng C, He X F, Han J W. Isometric Projection [C]// Proceeding of the National Conference on Artificial Intelligence, Vancouver, Canada, July 22-26, 2007, 1: 528-533.

    [18] Lee D D, Seung H S. Learning the Parts of Objects by Non-negative Matrix Factorization [J]. Nature(S0028-0836), 1999, 401(6755): 788-791.

    [19] Lee D D, Seung H S. Algorithms for Non-negative Matrix Factorization [C]// Advances in Neural Information Processing Systems, Vancouver, Canada, Dec 3-8, 2001, 13: 556-562.

    [20] Sajda P, Du S, Parra L. Recovery of Constituent Spectra Using Non-negative Matrix Factorization [J]. Proc. of SPIE(S0277-786X), 2003, 5207: 321-331.

    [21] Harris C, Stephens M. A Combined Corner and Edge Detector [C]// Proceedings of the 4th Alvey Vision Conference, Manchester, England, 1988: 147-151.

    LENG Cheng-cai, XU Wei, YAN Wei-dong, HE Li. Image Registration Based on Non-negative Matrix Factorization of Graph[J]. Opto-Electronic Engineering, 2011, 38(12): 137
    Download Citation