Sciweavers

242 search results - page 27 / 49
» Compact Fundamental Matrix Computation
Sort
View
ECCV
2000
Springer
15 years 11 months ago
On the Reprojection of 3D and 2D Scenes Without Explicit Model Selection
It is known that recovering projection matrices from planar con gurations is ambiguous, thus, posing the problem of model selection | is the scene planar 2D or non-planar 3D? For ...
Amnon Shashua, Shai Avidan
ICCV
2003
IEEE
15 years 3 months ago
On the Epipolar Geometry of the Crossed-Slits Projection
The Crossed-Slits (X-Slits) camera is defined by two nonintersecting slits, which replace the pinhole in the common perspective camera. Each point in space is projected to the im...
Doron Feldman, Tomás Pajdla, Daphna Weinsha...
AUTOMATICA
2008
116views more  AUTOMATICA 2008»
14 years 9 months ago
A dynamical systems approach to weighted graph matching
Graph matching is a fundamental problem that arises frequently in the areas of distributed control, computer vision, and facility allocation. In this paper, we consider the optimal...
Michael M. Zavlanos, George J. Pappas
CORR
2012
Springer
183views Education» more  CORR 2012»
13 years 5 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar
ECCV
2002
Springer
15 years 11 months ago
Maximizing Rigidity: Optimal Matching under Scaled-Orthography
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
João Costeira, João Maciel