Results 1  10
of
1,953,555
Noncrossing Matchings of Points with Geometric Objects
, 2011
"... Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a noncrossing matching between pointobject pairs. In this paper, we address the algorithmic problem of determining whether a noncrossing matching exists between a given pointobject p ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Given an ordered set of points and an ordered set of geometric objects in the plane, we are interested in finding a noncrossing matching between pointobject pairs. In this paper, we address the algorithmic problem of determining whether a noncrossing matching exists between a given pointobject
Iterative point matching for registration of freeform curves and surfaces
, 1994
"... A heuristic method has been developed for registering two sets of 3D curves obtained by using an edgebased stereo system, or two dense 3D maps obtained by using a correlationbased stereo system. Geometric matching in general is a difficult unsolved problem in computer vision. Fortunately, in ma ..."
Abstract

Cited by 656 (8 self)
 Add to MetaCart
, which is required for environment modeling (e.g., building a Digital Elevation Map). Objects are represented by a set of 3D points, which are considered as the samples of a surface. No constraint is imposed on the form of the objects. The proposed algorithm is based on iteratively matching points
Shape Matching and Object Recognition Using Shape Contexts
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2001
"... We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solv ing for correspondences between points on the two shapes, (2) using the correspondences to estimate an aligning transform ..."
Abstract

Cited by 1781 (21 self)
 Add to MetaCart
We present a novel approach to measuring similarity between shapes and exploit it for object recognition. In our framework, the measurement of similarity is preceded by (1) solv ing for correspondences between points on the two shapes, (2) using the correspondences to estimate an aligning
Object Recognition from Local ScaleInvariant Features
"... An object recognition system has been developed that uses a new class of local image features. The features are invariant to image scaling, translation, and rotation, and partially invariant to illumination changes and affine or 3D projection. These features share similar properties with neurons in ..."
Abstract

Cited by 2686 (13 self)
 Add to MetaCart
in inferior temporal cortex that are used for object recognition in primate vision. Features are efficiently detected through a staged filtering approach that identifies stable points in scale space. Image keys are created that allow for local geometric deformations by representing blurred image gradients
Bottleneck NonCrossing Matching in the Plane∗
, 2012
"... Let P be a set of 2n points in the plane, and letMC (resp., MNC) denote a bottleneck matching (resp., a bottleneck noncrossing matching) of P. We study the problem of computing MNC. We first prove that the problem is NPhard and does not admit a PTAS. Then, we present an O(n1.5 log0.5 n)time algor ..."
Abstract
 Add to MetaCart
Let P be a set of 2n points in the plane, and letMC (resp., MNC) denote a bottleneck matching (resp., a bottleneck noncrossing matching) of P. We study the problem of computing MNC. We first prove that the problem is NPhard and does not admit a PTAS. Then, we present an O(n1.5 log0.5 n
Distortion invariant object recognition in the dynamic link architecture
 IEEE TRANSACTIONS ON COMPUTERS
, 1993
"... We present an object recognition system based on the Dynamic Link Architecture, which is an extension to classical Artificial Neural Networks. The Dynamic Link Architecture exploits correlations in the finescale temporal structure of cellular signals in order to group neurons dynamically into hig ..."
Abstract

Cited by 632 (80 self)
 Add to MetaCart
are represented by sparse graphs, whose vertices are labeled by a multiresolution description in terms of a local power spectrum, and whose edges are labeled by geometrical distance vectors. Object recognition can be formulated as elastic graph matching, which is performed here by stochastic optimization of a
Using spin images for efficient object recognition in cluttered 3D scenes
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 1999
"... We present a 3D shapebased object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matching surfaces by matching points using the spinimage representation. The spinimage is a data level shape descriptor that i ..."
Abstract

Cited by 570 (9 self)
 Add to MetaCart
We present a 3D shapebased object recognition system for simultaneous recognition of multiple objects in scenes containing clutter and occlusion. Recognition is based on matching surfaces by matching points using the spinimage representation. The spinimage is a data level shape descriptor
Shape matching and object recognition using low distortion correspondence
 In CVPR
, 2005
"... We approach recognition in the framework of deformable shape matching, relying on a new algorithm for finding correspondences between feature points. This algorithm sets up correspondence as an integer quadratic programming problem, where the cost function has terms based on similarity of correspond ..."
Abstract

Cited by 413 (15 self)
 Add to MetaCart
of corresponding geometric blur point descriptors as well as the geometric distortion between pairs of corresponding feature points. The algorithm handles outliers, and thus enables matching of exemplars to query images in the presence of occlusion and clutter. Given the correspondences, we estimate an aligning
Efficient Variants of the ICP Algorithm
 INTERNATIONAL CONFERENCE ON 3D DIGITAL IMAGING AND MODELING
, 2001
"... The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points to the minim ..."
Abstract

Cited by 702 (5 self)
 Add to MetaCart
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of threedimensional models when an initial estimate of the relative pose is known. Many variants of ICP have been proposed, affecting all phases of the algorithm from the selection and matching of points
The geometry of graphs and some of its algorithmic applications
 COMBINATORICA
, 1995
"... In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations that res ..."
Abstract

Cited by 521 (19 self)
 Add to MetaCart
In this paper we explore some implications of viewing graphs as geometric objects. This approach offers a new perspective on a number of graphtheoretic and algorithmic problems. There are several ways to model graphs geometrically and our main concern here is with geometric representations
Results 1  10
of
1,953,555