Sciweavers

507 search results - page 77 / 102
» Computing Sparse Multiples of Polynomials
Sort
View
CVPR
2012
IEEE
11 years 10 months ago
Robust late fusion with rank minimization
In this paper, we propose a rank minimization method to fuse the predicted confidence scores of multiple models, each of which is obtained based on a certain kind of feature. Spe...
Guangnan Ye, Dong Liu, I-Hong Jhuo, Shih-Fu Chang
CVPR
2009
IEEE
1131views Computer Vision» more  CVPR 2009»
15 years 2 months ago
Continuous Depth Estimation for Multi-view Stereo
Depth-map merging approaches have become more and more popular in multi-view stereo (MVS) because of their flexibility and superior performance. The quality of depth map used fo...
Yebin Liu (Tsinghua University), Xun Cao (Tsinghu...
CVPR
2009
IEEE
15 years 2 months ago
Co-training with Noisy Perceptual Observations
Many perception and multimedia indexing problems involve datasets that are naturally comprised of multiple streams or modalities for which supervised training data is only sparsely...
Ashish Kapoor, Chris Mario Christoudias, Raquel Ur...
CVPR
2008
IEEE
14 years 9 months ago
Motion segmentation via robust subspace separation in the presence of outlying, incomplete, or corrupted trajectories
We examine the problem of segmenting tracked feature point trajectories of multiple moving objects in an image sequence. Using the affine camera model, this motion segmentation pr...
René Vidal, Roberto Tron, Shankar Rao, Yi M...
DAGM
2006
Springer
13 years 11 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz