Sciweavers

216 search results - page 6 / 44
» Learning Minimum Volume Sets
Sort
View
ICTAI
2006
IEEE
14 years 3 months ago
Learning to Predict Salient Regions from Disjoint and Skewed Training Sets
We present an ensemble learning approach that achieves accurate predictions from arbitrarily partitioned data. The partitions come from the distributed processing requirements of ...
Larry Shoemaker, Robert E. Banfield, Lawrence O. H...
IVC
2008
83views more  IVC 2008»
13 years 10 months ago
A minimum description length objective function for groupwise non-rigid image registration
Groupwise non-rigid registration aims to find a dense correspondence across a set of images, so that analogous structures in the images are aligned. For purely automatic inter-sub...
Stephen Marsland, Carole J. Twining, Christopher J...
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
14 years 10 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...
CVPR
2006
IEEE
14 years 12 months ago
Three-Dimensional Volume Reconstruction Based on Trajectory Fusion from Confocal Laser Scanning Microscope Images
In this paper, we address the problem of 3D volume reconstruction from depth adjacent subvolumes (i.e., sets of image frames) acquired using a confocal laser scanning microscope (...
Sang-Chul Lee, Peter Bajcsy
UAI
2003
13 years 11 months ago
Learning Riemannian Metrics
We consider the problem of learning a Riemannian metric associated with a given differentiable manifold and a set of points. Our approach to the problem involves choosing a metric...
Guy Lebanon