Results 1  10
of
998
Approximating the problem, not the solution: an alternative view of point set matching
"... Abstract. This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representational approximation, which involves a simplified and suboptimal modeling for the original problem, and algori ..."
Abstract
 Add to MetaCart
Abstract. This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representational approximation, which involves a simplified and suboptimal modeling for the original problem
An almost ideal demand system.
 American Economic Review,
, 1980
"... Ever since Richard Stone (1954) first estimated a system of demand equations derived explicitly from consumer theory, there has been a continuing search for alternative specifications and functional forms. Many models have been proposed, but perhaps the most important in current use, apart from the ..."
Abstract

Cited by 636 (0 self)
 Add to MetaCart
hope to be able to reveal more clearly the problems and potential solutions associated with the usual approach. I. Specification of the AIDS In much of the recent literature on systems of demand equations, the starting point has been the specification of a function which is general enough to act as a
TENSOR RANK AND THE ILLPOSEDNESS OF THE BEST LOWRANK APPROXIMATION PROBLEM
"... There has been continued interest in seeking a theorem describing optimal lowrank approximations to tensors of order 3 or higher, that parallels the Eckart–Young theorem for matrices. In this paper, we argue that the naive approach to this problem is doomed to failure because, unlike matrices, te ..."
Abstract

Cited by 194 (13 self)
 Add to MetaCart
and order2 tensors (i.e. matrices). In a more positive spirit, we propose a natural way of overcoming the illposedness of the lowrank approximation problem, by using weak solutions when true solutions do not exist. For this to work, it is necessary to characterize the set of weak solutions, and we do
Fast Approximate Point Set Matching for Information Retrieval
"... Abstract. We investigate randomised algorithms for subset matching with spatial point sets—given two sets of ddimensional points: a data set T consisting of n points and a pattern P consisting of m points, find the largest match for a subset of the pattern in the data set. This problem is known to ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We investigate randomised algorithms for subset matching with spatial point sets—given two sets of ddimensional points: a data set T consisting of n points and a pattern P consisting of m points, find the largest match for a subset of the pattern in the data set. This problem is known
Exact and Approximate Computational Geometry Solutions Of An Unrestricted Point Set Stereo Matching Problem
, 1994
"... In this paper we study the problem of computing an exact, or arbitrarily close to exact, solution of an unrestricted point set stereo matching problem. Within the context of classical approaches like the MarrPoggio algorithm, this means that we study how to solve the unrestricted basic subproblems ..."
Abstract
 Add to MetaCart
generalize the notion of a ffi approximate solution for point set congruence to the stereo matching problem and present an O(( ffl ffi ) k n 2+2k ) time and O( ffl ffi n 2 ) space ffi approximate algorithm for unrestricted stereo matching (ffl represents measurement inaccuracies in the image). We
Graphical models and point pattern matching
 IEEE Trans. PAMI
, 2006
"... Abstract—This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an optimal solution for the noiseless c ..."
Abstract

Cited by 39 (6 self)
 Add to MetaCart
Abstract—This paper describes a novel solution to the rigid point pattern matching problem in Euclidean spaces of any dimension. Although we assume rigid motion, jitter is allowed. We present a noniterative, polynomial time algorithm that is guaranteed to find an optimal solution for the noiseless
Approximation Algorithms for Bipartite and NonBipartite Matching in the Plane
 In SODA: ACMSIAM Symposium on Discrete Algorithms (A Conference on Theoretical and Experimental Analysis of Discrete Algorithms
, 1999
"... In the approximate Euclidean mincost perfect matching problem, we are a given a set V of 2n points in the plane, and a real number " ? 0, and we want to pair up the points (into n pairs) so that the sum of the distances between the paired points is within a multiplicative factor of (1 + " ..."
Abstract

Cited by 29 (4 self)
 Add to MetaCart
In the approximate Euclidean mincost perfect matching problem, we are a given a set V of 2n points in the plane, and a real number " ? 0, and we want to pair up the points (into n pairs) so that the sum of the distances between the paired points is within a multiplicative factor of (1
Matching Surfaces with Characteristic Points
"... We study approximation algorithms for a matching problem that is motivated by medical applications. Given a small set of points P ⊂ R3 and a surface S, the optimal matching of P with S is represented by a rigid transformation which maps P as ‘close as possible’ to S. Previous solutions either requir ..."
Abstract
 Add to MetaCart
We study approximation algorithms for a matching problem that is motivated by medical applications. Given a small set of points P ⊂ R3 and a surface S, the optimal matching of P with S is represented by a rigid transformation which maps P as ‘close as possible’ to S. Previous solutions either
Computing Largest Common Point Sets under Approximate Congruence
 IN PROC. 8TH ANNUAL EUROPEAN SYMPOSIUM ON ALGORITHMS, LNCS 1879
, 2000
"... The problem of computing a largest common point set (LCP) between two point sets under "congruence with the bottleneck matching metric has recently been a subject of extensive study. Although polynomial time solutions are known for the planar case and for restricted sets of transformations ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
The problem of computing a largest common point set (LCP) between two point sets under "congruence with the bottleneck matching metric has recently been a subject of extensive study. Although polynomial time solutions are known for the planar case and for restricted sets
Results 1  10
of
998