Sciweavers

1092 search results - page 138 / 219
» Convex Methods for Transduction
Sort
View
CVPR
2004
IEEE
16 years 3 months ago
Reconstructing Open Surfaces from Unorganized Data Points
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...
Jan Erik Solem, Anders Heyden
PKDD
2009
Springer
138views Data Mining» more  PKDD 2009»
15 years 8 months ago
Margin and Radius Based Multiple Kernel Learning
A serious drawback of kernel methods, and Support Vector Machines (SVM) in particular, is the difficulty in choosing a suitable kernel function for a given dataset. One of the appr...
Huyen Do, Alexandros Kalousis, Adam Woznica, Melan...
JMIV
2007
83views more  JMIV 2007»
15 years 1 months ago
Minimization of a Detail-Preserving Regularization Functional for Impulse Noise Removal
Recently, a powerful two-phase method for restoring images corrupted with high level impulse noise has been developed. The main drawback of the method is the computational efficie...
Jian-Feng Cai, Raymond H. Chan, Carmine Di Fiore
DAM
2007
177views more  DAM 2007»
15 years 1 months ago
On Khachiyan's algorithm for the computation of minimum-volume enclosing ellipsoids
Given A := {a1, . . . , am} ⊂ Rd whose affine hull is Rd, we study the problems of computing an approximate rounding of the convex hull of A and an approximation to the minimum ...
Michael J. Todd, E. Alper Yildirim
CVPR
2006
IEEE
16 years 3 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...