Sciweavers

37 search results - page 2 / 8
» Robust Point Correspondence by Concave Minimization
Sort
View
EMMCVPR
2001
Springer
13 years 10 months ago
A Double-Loop Algorithm to Minimize the Bethe Free Energy
Recent work (Yedidia, Freeman, Weiss [22]) has shown that stable points of belief propagation (BP) algorithms [12] for graphs with loops correspond to extrema of the Bethe free ene...
Alan L. Yuille
ICCV
2003
IEEE
14 years 7 months ago
Circular Motion Geometry by Minimal 2 Points in 4 Images
This paper describes a new and simple method of recovering the geometry of uncalibrated circular motion or single axis motion using a minimal data set of 2 points in 4 images. Thi...
Guang Jiang, Long Quan, Hung-Tat Tsui
CGF
2008
262views more  CGF 2008»
13 years 5 months ago
Global Correspondence Optimization for Non-Rigid Registration of Depth Scans
We present a registration algorithm for pairs of deforming and partial range scans that addresses the challenges of non-rigid registration within a single non-linear optimization....
Hao Li, Robert W. Sumner, Mark Pauly
ICRA
2010
IEEE
102views Robotics» more  ICRA 2010»
13 years 4 months ago
Immobilizing 2D serial chains in form closure grasps
: The immobilization of non-rigid objects is currently an active research area in robotics. This paper explores the problem by studying the immobilization of serial chains of rigid...
Elon Rimon, A. Frank van der Stappen
INFOCOM
2006
IEEE
13 years 11 months ago
Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks
— We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time varying channels. A network controller acts on randomly arriving data ...
Michael J. Neely