Sciweavers

2898 search results - page 461 / 580
» Robust Algorithms for Object Localization
Sort
View
102
Voted
CVPR
2008
IEEE
15 years 8 months ago
Subspace segmentation with outliers: A grassmannian approach to the maximum consensus subspace
Segmenting arbitrary unions of linear subspaces is an important tool for computer vision tasks such as motion and image segmentation, SfM or object recognition. We segment subspac...
Nuno Pinho da Silva, João Paulo Costeira
ICPR
2008
IEEE
15 years 8 months ago
A new multiobjective simulated annealing based clustering technique using stability and symmetry
Most clustering algorithms operate by optimizing (either implicitly or explicitly) a single measure of cluster solution quality. Such methods may perform well on some data sets bu...
Sriparna Saha, Sanghamitra Bandyopadhyay
114
Voted
PCM
2004
Springer
125views Multimedia» more  PCM 2004»
15 years 7 months ago
Semantic Analysis of Basketball Video Using Motion Information
Abstract. This paper presents a new method for extracting semantic information from basketball video. Our approach consists of three stages: shot and scene boundary detection, scen...
Song Liu, Haoran Yi, Liang-Tien Chia, Deepu Rajan,...
COMGEO
2006
ACM
15 years 2 months ago
Inner and outer rounding of Boolean operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...
Olivier Devillers, Philippe Guigue
TMC
2010
151views more  TMC 2010»
15 years 20 days ago
Exploiting and Defending Opportunistic Scheduling in Cellular Data Networks
—Third Generation (3G) cellular networks take advantage of time-varying and location-dependent channel conditions of mobile users to provide broadband services. Under fairness an...
Radmilo Racic, Denys Ma, Hao Chen, Xin Liu