Sciweavers

1539 search results - page 176 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
CVPR
2007
IEEE
15 years 5 days ago
Approximate Nearest Subspace Search with Applications to Pattern Recognition
Linear and affine subspaces are commonly used to describe appearance of objects under different lighting, viewpoint, articulation, and identity. A natural problem arising from the...
Ronen Basri, Tal Hassner, Lihi Zelnik-Manor
ECCV
2004
Springer
15 years 2 days ago
Detecting Keypoints with Stable Position, Orientation, and Scale under Illumination Changes
Local feature approaches to vision geometry and object recognition are based on selecting and matching sparse sets of visually salient image points, known as `keypoints' or `p...
Bill Triggs
TOG
2012
160views Communications» more  TOG 2012»
12 years 18 days ago
Highlight microdisparity for improved gloss depiction
Human stereo perception of glossy materials is substantially different from the perception of diffuse surfaces: A single point on a diffuse object appears the same for both eyes, ...
Krzysztof Templin, Piotr Didyk, Tobias Ritschel, K...
AMDO
2006
Springer
14 years 1 months ago
Collision Detection Trough Deconstruction of Articulated Objects
Abstract. Many applications in computer graphics require fast and robust collision detection algorithms. The problem of simulating motion in an articulated chain has been well stud...
Roberto Therón, Vidal Moreno, Belén ...
AGENTS
1997
Springer
14 years 2 months ago
Adaptable Local Level Arbitration of Behaviors
During the last few years, and in an attempt to provide an ecient alternative to classical methods to designing robot control structures, the behavior-based approach has emerged....
Mohamed Salah Hamdi, Karl Kaiser