Sciweavers

2009 search results - page 91 / 402
» Dense Interest Points
Sort
View
ICCV
2011
IEEE
12 years 8 months ago
Geometrically Consistent Elastic Matching of 3D Shapes: A Linear Programming Solution
We propose a novel method for computing a geometrically consistent and spatially dense matching between two 3D shapes. Rather than mapping points to points we match infinitesimal...
Thomas Windheuser, Ulrich Schlickewei, Frank R. Sc...
CVPR
2012
IEEE
11 years 10 months ago
Scale resilient, rotation invariant articulated object matching
A novel method is proposed for matching articulated objects in cluttered videos. The method needs only a single exemplar image of the target object. Instead of using a small set o...
Hao Jiang, Tai-Peng Tian, Kun He, Stan Sclaroff
ICPR
2008
IEEE
14 years 9 months ago
Fast and regularized local metric for query-based operations
To learn a metric for query?based operations, we combine the concept underlying manifold learning algorithms and the minimum volume ellipsoid metric in a unified algorithm to find...
Frank P. Ferrie, Karim T. Abou-Moustafa
ARITH
2005
IEEE
14 years 1 months ago
A Fast-Start Method for Computing the Inverse Tangent
In a search for an algorithm to compute atan(x) which has both low latency and few floating point instructions, an interesting variant of familiar trigonometry formulas was disco...
Peter W. Markstein
IEEECGIV
2005
IEEE
14 years 1 months ago
Combinations of Range Data and Panoramic Images - New Opportunities in 3D Scene Modeling
The paper informs about rotating line cameras (which capture images of several 100 Megapixel), their use for creating (stereo) panoramas, and how they can be used for texturing cl...
Reinhard Klette, Karsten Scheibe