Back to search

Subspace matching: Unique solution to point matching with geometric constraints

Data up to Jan 2025

Published2009
Citations34
References20

Total Citations Per Year

Abstract

References (20)

Shape matching and object recognition using shape contexts

2002 • 6,258 citations

Integer and Combinatorial Optimization

1990 • 5,699 citations

Integer and combinatorial optimization

1999 • 1,151 citations

Robust registration of 2D and 3D point sets

2003 • 882 citations

Shape Matching and Object Recognition Using Low Distortion Correspondences

2005 • 865 citations

New algorithms for 2D and 3D point matching

1998 • 559 citations

Feature Correspondence Via Graph Matching: Models and Global Optimization

2008 • 386 citations

SoftPOSIT: Simultaneous Pose and Correspondence Determination

2004 • 230 citations

The 3D-3D Registration Problem Revisited

2007 • 197 citations

Implementation techniques for geometric branch-and-bound matching methods

2003 • 102 citations

A polynomial-time bound for matching and registration with outliers

2008 • 80 citations

Matching by Linear Programming and Successive Convexification

2007 • 79 citations

Limitations of non model-based recognition schemes

1992 • 69 citations

Model group indexing for recognition

2002 • 41 citations

ANSIG—An analytic signature for permutation-invariant two-dimensional shape representation

2008 • 20 citations

Finding Point Correspondences in Motion Sequences Preserving Affine Structure

1997 • 20 citations

Optimal Point Correspondence through the Use of Rank Constraints

2005 • 19 citations

Dimension-free affine shape matching through subspace invariance

2009 • 15 citations

LASIC: A model invariant framework for correspondence

2008 • 3 citations

Dimension-free affine shape matching through subspace invariance

2009 • 2 citations

Cited By (0)

Loading...