NDLI: Graph Matching using Commute Time Spanning Trees

Content Provider	IEEE Xplore Digital Library
Author	Huaijun Qiu Hancock, E.R.
Copyright Year	2006
Description	Author affiliation: Dept. of Comput. Sci., York Univ. (Huaijun Qiu; Hancock, E.R.)
Abstract	This paper exploits the properties of the commute time for the purposes of graph matching. Our starting point is the random walk on the graph, which is determined by the heat-kernel of the graph and can be computed from the spectrum of the graph Laplacian. We characterise the random walk using the commute time between nodes, and show how this quantity may be computed from the Laplacian spectrum using the discrete Green's function. We use the commute-time to locate the minimum spanning tree of the graph. The spanning trees located using commute time prove to be stable to structural variations. We match the graphs by applying a tree-matching method to the spanning trees. We experiment with the method on synthetic and real-world image data, where it proves to be effective
Sponsorship	IEEE CPS
Starting Page	1224
Ending Page	1227
File Size	225120
Page Count	4
File Format	PDF
ISBN	0769525210
ISSN	10514651
DOI	10.1109/ICPR.2006.614
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-08-20
Publisher Place	China
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Tree graphs Laplace equations Computer science Information retrieval Image retrieval Pattern analysis Clustering algorithms Search engines Computer vision Image segmentation
Content Type	Text
Resource Type	Article
Subject	Computer Vision and Pattern Recognition

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 using Commute Time Spanning Tr

Graph Matching using Commute Time Spanning Trees

Graph drawing using quantum commute time

A new graph-theoretic approach to clustering and segmentation

Word image matching using dynamic time warping

Clustering and Embedding Using Commute Times

Normalized tree partitioning for image segmentation

Hierarchical regions matching in image sequences through association graph

Relaxed Cheeger Cut for image segmentation

Graph Matching using Commute Time Spanning Trees

Similar Documents

Graph Matching using Commute Time Spanning Tr

Graph Matching using Commute Time Spanning Trees

Graph drawing using quantum commute time

A new graph-theoretic approach to clustering and segmentation

Word image matching using dynamic time warping

Clustering and Embedding Using Commute Times

Normalized tree partitioning for image segmentation

Hierarchical regions matching in image sequences through association graph

Relaxed Cheeger Cut for image segmentation

Graph Matching using Commute Time Spanning Trees