Sciweavers

518 search results - page 59 / 104
» Object correspondence as a machine learning problem
Sort
View
ICML
2004
IEEE
15 years 7 months ago
Optimising area under the ROC curve using gradient descent
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...
Alan Herschtal, Bhavani Raskutti
MLMI
2007
Springer
15 years 8 months ago
Frequency Domain Linear Prediction for QMF Sub-bands and Applications to Audio Coding
Abstract. This paper proposes an analysis technique for wide-band audio applications based on the predictability of the temporal evolution of Quadrature Mirror Filter (QMF) sub-ban...
Petr Motlícek, Sriram Ganapathy, Hynek Herm...
CVPR
2008
IEEE
16 years 4 months ago
Local minima free Parameterized Appearance Models
Parameterized Appearance Models (PAMs) (e.g. Eigentracking, Active Appearance Models, Morphable Models) are commonly used to model the appearance and shape variation of objects in...
Minh Hoai Nguyen, Fernando De la Torre
VMV
2008
107views Visualization» more  VMV 2008»
15 years 3 months ago
Learning with Few Examples using a Constrained Gaussian Prior on Randomized Trees
Machine learning with few training examples always leads to over-fitting problems, whereas human individuals are often able to recognize difficult object categories from only one ...
Erik Rodner, Joachim Denzler
SODA
2001
ACM
79views Algorithms» more  SODA 2001»
15 years 3 months ago
Learning Markov networks: maximum bounded tree-width graphs
Markov networks are a common class of graphical models used in machine learning. Such models use an undirected graph to capture dependency information among random variables in a ...
David R. Karger, Nathan Srebro