NDLI: Deformable Graph Matching

Content Provider	IEEE Xplore Digital Library
Author	Feng Zhou De la Torre, F.
Copyright Year	2013
Description	Author affiliation: Robot. Inst., Carnegie Mellon Univ., Pittsburgh, PA, USA (Feng Zhou; De la Torre, F.)
Abstract	Graph matching (GM) is a fundamental problem in computer science, and it has been successfully applied to many problems in computer vision. Although widely used, existing GM algorithms cannot incorporate global consistence among nodes, which is a natural constraint in computer vision problems. This paper proposes deformable graph matching (DGM), an extension of GM for matching graphs subject to global rigid and non-rigid geometric constraints. The key idea of this work is a new factorization of the pair-wise affinity matrix. This factorization decouples the affinity matrix into the local structure of each graph and the pair-wise affinity edges. Besides the ability to incorporate global geometric transformations, this factorization offers three more benefits. First, there is no need to compute the costly (in space and time) pair-wise affinity matrix. Second, it provides a unified view of many GM methods and extends the standard iterative closest point algorithm. Third, it allows to use the path-following optimization algorithm that leads to improved optimization strategies and matching performance. Experimental results on synthetic and real databases illustrate how DGM outperforms state-of-the-art algorithms for GM. The code is available at http://humansensing.cs.cmu.edu/fgm.
Starting Page	2922
Ending Page	2929
File Size	985874
Page Count	8
File Format	PDF
ISBN	9780769549897
ISSN	10636919
DOI	10.1109/CVPR.2013.376
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-06-23
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Iterative closest point algorithm Optimization Transmission line matrix methods Computer vision Approximation algorithms Linear programming Vectors
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

Factorized graph matching

Multi-objects interpretation

Point Matching in the Presence of Outliers in Both Point Sets: A Concave Optimization Approach

Planar Structure Based Registration of Multiple Range Images

A tensor-based algorithm for high-order graph matching

Symmetry-Aware Nonrigid Matching of Incomplete 3D Surfaces

Free form shape matching using deterministic annealing and softassign

Linear solution to scale and rotation invariant object matching

An Iterative Algorithm for Approximate Median Graph Computation

Deformable Graph Matching

Similar Documents

Factorized graph matching

Multi-objects interpretation

Point Matching in the Presence of Outliers in Both Point Sets: A Concave Optimization Approach

Planar Structure Based Registration of Multiple Range Images

A tensor-based algorithm for high-order graph matching

Symmetry-Aware Nonrigid Matching of Incomplete 3D Surfaces

Free form shape matching using deterministic annealing and softassign

Linear solution to scale and rotation invariant object matching

An Iterative Algorithm for Approximate Median Graph Computation

Deformable Graph Matching