NDLI: Spectral Multiplicity Tolerant Inexact Graph Matching

Content Provider	IEEE Xplore Digital Library
Author	Wei Feng Zhi-Qiang Liu
Copyright Year	2006
Description	Author affiliation: City Univ. of Hong Kong, Hong Kong (Wei Feng; Zhi-Qiang Liu)
Abstract	A graph can be exactly specified by the spectrum and corresponding eigenvectors of its adjacency matrix. This provides a solid foundation for spectrum based graph matching. However, most previous methods ignore the spectral multiplicity, which may significantly affect the matching accuracy. In this paper, we address the problem of minimizing the matching error when graph spectral multiplicity is involved. We first model spectral multiplicity by the sub-eigenspace rotation matrix R, and integrate R into the spectrum based graph matching model. We then focus on the exact graph matching problem, and show how to establish the vertex-to-vertex correspondence by iteratively optimizing the sub-eigenspace rotation matrix R and the permutation matrix P. A reliable matching initialization method is proposed to make this process converge rapidly. Finally, we extend the approach to the inexact graph matching problem by optimally warping two graphs to the same size. The proposed approach is robust and efficient. We support our approach with numerical experiments and demonstrate its effectiveness in the practical application of uncalibrated stereo matching.
Starting Page	1196
Ending Page	1201
File Size	2064899
Page Count	6
File Format	PDF
ISBN	1424400996
DOI	10.1109/ICSMC.2006.384877
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-10-08
Publisher Place	Taiwan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Surface-mount technology Symmetric matrices Optimization methods Robustness Application software Clustering algorithms Cybernetics Iterative methods Convergence Solids
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Graph matching based a probabilistic spectral method

Image segmentation using spectral clustering

SAOR Preconditioned Conjugate Gradient Method

A parallel algorithm for the diagonalization of symmetric matrices

Automatic Spectral Clustering and its Application

Ant Colony Algorithms with Characteristic of Clustering for Surface Mount Technology Optimization

Embedding via clustering: using spectral information to guide dimensionality reduction

Eigenvectors for clustering: Unipartite, bipartite, and directed graph cases

Modified K-Means Clustering Algorithm

Spectral Multiplicity Tolerant Inexact Graph Matching

Similar Documents

Graph matching based a probabilistic spectral method

Image segmentation using spectral clustering

SAOR Preconditioned Conjugate Gradient Method

A parallel algorithm for the diagonalization of symmetric matrices

Automatic Spectral Clustering and its Application

Ant Colony Algorithms with Characteristic of Clustering for Surface Mount Technology Optimization

Embedding via clustering: using spectral information to guide dimensionality reduction

Eigenvectors for clustering: Unipartite, bipartite, and directed graph cases

Modified K-Means Clustering Algorithm

Spectral Multiplicity Tolerant Inexact Graph Matching