Sciweavers

167 search results - page 4 / 34
» Constraints for closest point finding
Sort
View
ICLP
1999
Springer
13 years 11 months ago
Finding Fair Allocations for the Coalition Problem with Constraints
Fair allocation of payoffs among cooperating players who can form various coalitions of differing utilities is the classic game theoretic “coalition problem.” Shapley’s va...
Evan Tick, Roland H. C. Yap, Michael J. Maher
CORR
2010
Springer
171views Education» more  CORR 2010»
13 years 7 months ago
Randomized Lattice Decoding
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...
Shuiyin Liu, Cong Ling, Damien Stehlé
ISVC
2010
Springer
13 years 5 months ago
Efficient Marker Matching Using Pair-Wise Constraints in Physical Therapy
In this paper, we report a robust, efficient, and automatic method for matching infrared tracked markers for human motion analysis in computer-aided physical therapy applications. ...
Gregory Johnson, Nianhua Xie, Jill Slaboda, Y. Jus...
PAMI
2010
241views more  PAMI 2010»
13 years 1 months ago
Point Set Registration: Coherent Point Drift
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation ...
Andriy Myronenko, Xubo B. Song
ICCV
2009
IEEE
15 years 19 hour ago
Subspace matching: Unique solutions to point matching with geometric constraints
Finding correspondences between feature points is one of the most relevant problems in the whole set of visual tasks. In this paper we address the problem of matching a feature ...
Manuel Marques, Marko Stosic and Joao Costeira