Sciweavers

6365 search results - page 18 / 1273
» Fast Local Computation Algorithms
Sort
View
SCALESPACE
1999
Springer
15 years 10 months ago
Fast Marching to Moving Object Location
In this paper we address two important problems in motion analysis: the detection of moving objects and their localization. Statistical and level set approaches are adopted in orde...
Eftychios Sifakis, George Tziritas
IPSN
2009
Springer
16 years 19 days ago
Near-optimal Bayesian localization via incoherence and sparsity
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
Volkan Cevher, Petros Boufounos, Richard G. Barani...
AE
2005
Springer
15 years 11 months ago
Memetic Algorithms for the MinLA Problem
This paper presents a new Memetic Algorithm designed to compute near optimal solutions for the MinLA problem. It incorporates a highly specialized crossover operator, a fast MinLA ...
Eduardo Rodriguez-Tello, Jin-Kao Hao, Jose Torres-...
CVPR
2010
IEEE
15 years 6 months ago
Fast directional chamfer matching
We study the object localization problem in images given a single hand-drawn example or a gallery of shapes as the object model. Although many shape matching algorithms have been ...
Ming-Yu Liu, Oncel Tuzel, Ashok Veeraraghavan, Ram...
153
Voted
ICMCS
2005
IEEE
102views Multimedia» more  ICMCS 2005»
15 years 11 months ago
Fast camera calibration for the analysis of sport sequences
Semantic analysis of sport sequences requires camera calibration to obtain player and ball positions in real-world coordinates. For court sports like tennis, the marker lines on t...
Dirk Farin, Jungong Han, Peter H. N. de With