Sciweavers

106 search results - page 9 / 22
» Constraints on Coplanar Moving Points
Sort
View
85
Voted
IOR
2010
98views more  IOR 2010»
14 years 9 months ago
A Shadow Simplex Method for Infinite Linear Programs
We present a Simplex-type algorithm, that is, an algorithm that moves from one extreme point of the infinite-dimensional feasible region to another not necessarily adjacent extrem...
Archis Ghate, Dushyant Sharma, Robert L. Smith
ICRA
2009
IEEE
275views Robotics» more  ICRA 2009»
15 years 6 months ago
Real-time monocular visual odometry for on-road vehicles with 1-point RANSAC
— This paper presents a system capable of recovering the trajectory of a vehicle from the video input of a single camera at a very high frame-rate. The overall frame-rate is limi...
Davide Scaramuzza, Friedrich Fraundorfer, Roland S...
GD
2006
Springer
15 years 3 months ago
Integrating Edge Routing into Force-Directed Layout
Abstract. The typical use of force-directed layout is to create organiclooking, straight-edge drawings of large graphs while combinatorial techniques are generally preferred for hi...
Tim Dwyer, Kim Marriott, Michael Wybrow
115
Voted
ICCV
2011
IEEE
13 years 11 months ago
Kernel Non-Rigid Structure from Motion
Non-rigid structure from motion (NRSFM) is a difficult, underconstrained problem in computer vision. The standard approach in NRSFM constrains 3D shape deformation using a linear...
Paulo F. U. Gotardo, Aleix M. Martinez
121
Voted
ECCV
2010
Springer
15 years 2 months ago
5D Motion Subspaces for Planar Motion
In practice, rigid objects often move on a plane. The object then rotates around a fixed axis and translates in a plane orthogonal to this axis. For a concrete example, think of a...