Sciweavers

545 search results - page 46 / 109
» Estimating the Probability of Approximate Matches
Sort
View
106
Voted
CVPR
2007
IEEE
16 years 2 months ago
Efficient MRF Deformation Model for Non-Rigid Image Matching
We propose a novel MRF-based model for deformable image matching (also known as registration). The deformation is described by a field of discrete variables, representing displace...
Alexander Shekhovtsov, Ivan Kovtun, Václav ...
KDD
2004
ACM
170views Data Mining» more  KDD 2004»
15 years 6 months ago
Estimating the size of the telephone universe: a Bayesian Mark-recapture approach
Mark-recapture models have for many years been used to estimate the unknown sizes of animal and bird populations. In this article we adapt a finite mixture mark-recapture model i...
David Poole
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 4 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
HUC
2004
Springer
15 years 6 months ago
Particle Filters for Location Estimation in Ubiquitous Computing: A Case Study
Location estimation is an important part of many ubiquitous computing systems. Particle filters are simulation-based probabilistic approximations which the robotics community has ...
Jeffrey Hightower, Gaetano Borriello
TIT
2010
174views Education» more  TIT 2010»
14 years 7 months ago
Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
Compressed sensing (CS) has recently emerged as a powerful signal acquisition paradigm. In essence, CS enables the recovery of high-dimensional sparse signals from relatively few ...
Jarvis Haupt, Waheed Uz Zaman Bajwa, Gil M. Raz, R...