Sciweavers

60 search results - page 7 / 12
» Subspace Constrained Mean-Shift
Sort
View
AAAI
1994
15 years 1 months ago
Activity Analysis: The Qualitative Analysis of Stationary Points for Optimal Reasoning
We present a theory of a modeler's problem decomposition skills in the context of optimal reasonzng -- the use of qualitative modeling to strategically guide numerical explor...
Brian C. Williams, Jonathan Cagan
CVPR
2009
IEEE
1132views Computer Vision» more  CVPR 2009»
16 years 6 months ago
Observable Subspaces for 3D Human Motion Recovery
The articulated body models used to represent human motion typically have many degrees of freedom, usually expressed as joint angles that are highly correlated. T...
Andrea Fossati (EPFL), Mathieu Salzmann (Universit...
131
Voted
TIFS
2008
157views more  TIFS 2008»
14 years 11 months ago
Subspace Approximation of Face Recognition Algorithms: An Empirical Study
We present a theory for constructing linear subspace approximations to face-recognition algorithms and empirically demonstrate that a surprisingly diverse set of face-recognition a...
Pranab Mohanty, Sudeep Sarkar, Rangachar Kasturi, ...
ICCS
2007
Springer
15 years 5 months ago
Dynamic Tracking of Facial Expressions Using Adaptive, Overlapping Subspaces
We present a Dynamic Data Driven Application System (DDDAS) to track 2D shapes across large pose variations by learning non-linear shape manifold as overlapping, piecewise linear s...
Dimitris N. Metaxas, Atul Kanaujia, Zhiguo Li
104
Voted
SIAMJO
2008
114views more  SIAMJO 2008»
14 years 11 months ago
An Inexact SQP Method for Equality Constrained Optimization
We present an algorithm for large-scale equality constrained optimization. The method is based on a characterization of inexact sequential quadratic programming (SQP) steps that ca...
Richard H. Byrd, Frank E. Curtis, Jorge Nocedal