Sciweavers

202 search results - page 32 / 41
» Privacy-preservation for gradient descent methods
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 3 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
CVPR
2008
IEEE
16 years 1 months ago
Enforcing convexity for improved alignment with constrained local models
Constrained local models (CLMs) have recently demonstrated good performance in non-rigid object alignment/tracking in comparison to leading holistic approaches (e.g., AAMs). A maj...
Yang Wang, Simon Lucey, Jeffrey F. Cohn
ECCV
2008
Springer
16 years 1 months ago
Continuous Energy Minimization Via Repeated Binary Fusion
Abstract. Variational problems, which are commonly used to solve lowlevel vision tasks, are typically minimized via a local, iterative optimization strategy, e.g. gradient descent....
Werner Trobin, Thomas Pock, Daniel Cremers, Horst ...
ICIP
2007
IEEE
16 years 1 months ago
Modeling of Front Evolution with Graph Cut Optimization
In this paper, we present a novel active contour model, in which the traditional gradient descent optimization is replaced by graph cut optimization. The basic idea is to first de...
Hang Chang, Qing Yang, Manfred Auer, Bahram Parvin
ICMCS
2006
IEEE
192views Multimedia» more  ICMCS 2006»
15 years 5 months ago
Classifier Optimization for Multimedia Semantic Concept Detection
In this paper, we present an AUC (i.e., the Area Under the Curve of Receiver Operating Characteristics (ROC)) maximization based learning algorithm to design the classifier for ma...
Sheng Gao, Qibin Sun