NDLI: Many-to-many graph matching via metric embedding

Content Provider	IEEE Xplore Digital Library
Author	Keselman, Y. Shokoufandeh, A. Demirci, M.F. Dickinson, S.
Copyright Year	2003
Description	Author affiliation: DePaul Univ., Chicago, IL, USA (Keselman, Y.)
Abstract	Graph matching is an important component in many object recognition algorithms. Although most graph matching algorithms seek a one-to-one correspondence between nodes, it is often the case that a more meaningful correspondence exists between a cluster of nodes in one graph and a cluster of nodes in the other. We present a matching algorithm that establishes many-to-many correspondences between nodes of noisy, vertex-labeled weighted graphs. The algorithm is based on recent developments in efficient low-distortion metric embedding of graphs into normed vector spaces. By embedding weighted graphs into normed vector spaces, we reduce the problem of many-to-many graph matching to that of computing a distribution-based distance measure between graph embeddings. We use a specific measure, the earth mover's distance, to compute distances between sets of weighted vectors. Empirical evaluation of the algorithm on an extensive set of recognition trials demonstrates both the robustness and efficiency of the overall approach.
Sponsorship	IEEE Comput. Soc Tech. Committee on Pattern Anal. & Machine Intelligence (TCPAMI)
File Size	564880
File Format	PDF
ISBN	0769519008
ISSN	10636919
DOI	10.1109/CVPR.2003.1211441
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-06-18
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Clustering algorithms Earth Object recognition Extraterrestrial measurements Distributed computing Embedded computing Motion measurement Image segmentation Noise robustness Computer Society
Content Type	Text
Resource Type	Article
Subject	Computer Vision and Pattern Recognition Software

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

Feature correspondence and deformable object matching via agglomerative correspondence clustering

Mode-seeking on graphs via random walks

Improved subspace clustering via exploitation of spatial constraints

Articulated Shape Matching Using Locally Linear Embedding and Orthogonal Alignment

Robust Subspace Clustering via Half-Quadratic Minimization

Graph matching using spectral embedding and alignment

Robust motion segmentation via refined sparse subspace clustering

Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion

Geodesic K-means clustering

Many-to-many graph matching via metric embedding

Similar Documents

Feature correspondence and deformable object matching via agglomerative correspondence clustering

Mode-seeking on graphs via random walks

Improved subspace clustering via exploitation of spatial constraints

Articulated Shape Matching Using Locally Linear Embedding and Orthogonal Alignment

Robust Subspace Clustering via Half-Quadratic Minimization

Graph matching using spectral embedding and alignment

Robust motion segmentation via refined sparse subspace clustering

Learning Non-Metric Partial Similarity Based on Maximal Margin Criterion

Geodesic K-means clustering

Many-to-many graph matching via metric embedding