Sciweavers

98 search results - page 4 / 20
» Robust ranking models via risk-sensitive optimization
Sort
View
ICCV
2011
IEEE
13 years 9 months ago
Distributed Cosegmentation via Submodular Optimization on Anisotropic Diffusion
The saliency of regions or objects in an image can be significantly boosted if they recur in multiple images. Leveraging this idea, cosegmentation jointly segments common regions...
Gunhee Kim, Eric P. Xing, Li Fei-Fei, Takeo Kanade
CVPR
2008
IEEE
15 years 11 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...
ICPR
2008
IEEE
15 years 3 months ago
Robust indoor activity recognition via boosting
In this paper, a novel statistical indoor activity recognition algorithm is introduced. While conditional random fields (CRFs) have prominent properties to this task, no optimal ...
Masamichi Shimosaka, Taketoshi Mori, Tomomasa Sato
TSP
2008
124views more  TSP 2008»
14 years 9 months ago
Robust Beamforming via Worst-Case SINR Maximization
Minimum variance beamforming, which uses a weight vector that maximizes the signal-to-interference-plus-noise ratio (SINR), is often sensitive to estimation error and uncertainty i...
Seung-Jean Kim, Alessandro Magnani, Almir Mutapcic...
ADC
2006
Springer
136views Database» more  ADC 2006»
15 years 3 months ago
A multi-step strategy for approximate similarity search in image databases
Many strategies for similarity search in image databases assume a metric and quadratic form-based similarity model where an optimal lower bounding distance function exists for fil...
Paul Wing Hing Kwan, Junbin Gao