Sciweavers

119 search results - page 22 / 24
» A relaxed approach to combinatorial problems in robustness a...
Sort
View
JMLR
2008
159views more  JMLR 2008»
13 years 8 months ago
Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
Andreas Krause, Ajit Paul Singh, Carlos Guestrin
CVPR
2010
IEEE
14 years 5 months ago
Object Detection via Boundary Structure Segmentation
We address the problem of object detection and segmentation using holistic properties of object shape. Global shape representations are highly susceptible to clutter inevitably pr...
Alexander Toshev, Ben Taskar, Kostas Daniilidis
MM
2010
ACM
169views Multimedia» more  MM 2010»
13 years 9 months ago
CO3 for ultra-fast and accurate interactive segmentation
This paper presents an interactive image segmentation framework which is ultra-fast and accurate. Our framework, termed "CO3", consists of three components: COupled repr...
Yibiao Zhao, Song Chun Zhu, Siwei Luo
MICCAI
2007
Springer
14 years 9 months ago
Non-rigid Image Registration Using Graph-cuts
Non-rigid image registration is an ill-posed yet challenging problem due to its supernormal high degree of freedoms and inherent requirement of smoothness. Graph-cuts method is a p...
Tommy W. H. Tang, Albert C. S. Chung
MEMETIC
2010
311views more  MEMETIC 2010»
13 years 3 months ago
Iterated local search with Powell's method: a memetic algorithm for continuous global optimization
In combinatorial solution spaces Iterated Local Search (ILS) turns out to be exceptionally successful. The question arises: is ILS also capable of improving the optimization proces...
Oliver Kramer