Sciweavers

309 search results - page 15 / 62
» Smooth Optimization with Approximate Gradient
Sort
View
86
Voted
SGP
2003
14 years 11 months ago
Approximating and Intersecting Surfaces from Points
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...
Anders Adamson, Marc Alexa
CEC
2008
IEEE
15 years 4 months ago
A study on constrained MA using GA and SQP: Analytical vs. finite-difference gradients
— Many deterministic algorithms in the context of constrained optimization require the first-order derivatives, or the gradient vectors, of the objective and constraint function...
Stephanus Daniel Handoko, Chee Keong Kwoh, Yew-Soo...
CVPR
2008
IEEE
15 years 11 months ago
Conditional density learning via regression with application to deformable shape segmentation
Many vision problems can be cast as optimizing the conditional probability density function p(C|I) where I is an image and C is a vector of model parameters describing the image. ...
Jingdan Zhang, Shaohua Kevin Zhou, Dorin Comaniciu...
JMLR
2006
124views more  JMLR 2006»
14 years 9 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos
CVPR
2009
IEEE
16 years 4 months ago
Stochastic Gradient Kernel Density Mode-Seeking
As a well known fixed-point iteration algorithm for kernel density mode-seeking, Mean-Shift has attracted wide attention in pattern recognition field. To date, Mean-Shift algorit...
Xiaotong Yuan, Stan Z. Li