Sciweavers

985 search results - page 93 / 197
» Piercing Convex Sets
Sort
View
CVPR
2009
IEEE
16 years 11 months ago
Continuous Maximal Flows and Wulff Shapes: Application to MRFs
Convex and continuous energy formulations for low level vision problems enable efficient search procedures for the corresponding globally optimal solutions. In this work we exte...
Christopher Zach (UNC Chapel Hill), Marc Niethamme...
VIS
2007
IEEE
138views Visualization» more  VIS 2007»
16 years 5 months ago
A Flexible Multi-Volume Shader Framework for Arbitrarily Intersecting Multi-Resolution Datasets
We present a powerful framework for 3D-texture-based rendering of multiple arbitrarily intersecting volumetric datasets. Each volume is represented by a multi-resolution octree-bas...
John Plate, Thorsten Holtkaemper, Bernd Froehlic...
ICML
2009
IEEE
16 years 5 months ago
Sparse Gaussian graphical models with unknown block structure
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
Benjamin M. Marlin, Kevin P. Murphy
CVPR
2010
IEEE
1192views Computer Vision» more  CVPR 2010»
16 years 26 days ago
RASL: Robust Alignment by Sparse and Low-rank Decomposition for Linearly Correlated Images
This paper studies the problem of simultaneously aligning a batch of linearly correlated images despite gross corruption (such as occlusion). Our method seeks an optimal set of im...
Yigang Peng, Arvind Balasubramanian, John Wright, ...
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
15 years 11 months ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario