3-dimensional matching

Known as: 3d matching, Hypergraph matching, Tripartite matching

In the mathematical discipline of graph theory, a 3-dimensional matching is a generalization of bipartite matching (also known as 2-dimensional…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

Many autonomous vehicles require precise localization into a prior map in order to support planning and to leverage semantic…

2015

The reconstruction of broken artifacts is a common task in archeology domain; it can be supported now by 3D data acquisition…

2010

Face recognition is the identification of humans by the unique characteristics of their faces and forms the basis for many…

2008

Abstract This paper presents a pose measurement method of a 3D object. The proposed method utilizes an evolutionary search…

2006

In this paper, we propose a novel face recognition approach based on 2.5D/3D shape matching. While most of existing methods use…

2004

Multiple modality biometric approaches are proposed integrating two-dimensional face appearance with ear appearance, three…

2004

Suppose that two perspective views of four world points are given, that the intrinsic parameters are known, but the camera poses…

1999

. We investigate the complexity of the Maximum Induced Matching problem on regular graphs and trees. The problem is shown to be…

1993

Describes an automated, retrospective approach to register CT and MR brain images, using patient related image properties only…

1991

Addresses the problem of autonomous navigation of mobile robots on rough terrains. The contribution is a geometrical path…