Sciweavers

369 search results - page 20 / 74
» Global Optimization for Value Function Approximation
Sort
View
ICRA
2006
IEEE
119views Robotics» more  ICRA 2006»
14 years 2 months ago
Polygonal Approximation of Laser Range Data based on Perceptual Grouping and EM
— Our goal is polygonal approximation of laser range data points obtained by a mobile robot. The proposed approach provides a precise estimation of the number of model components...
Longin Jan Latecki, Rolf Lakämper
IJCV
2011
180views more  IJCV 2011»
13 years 3 months ago
Global Minimization for Continuous Multiphase Partitioning Problems Using a Dual Approach
This paper is devoted to the optimization problem of continuous multipartitioning, or multi-labeling, which is based on a convex relaxation of the continuous Potts model. In contr...
Egil Bae, Jing Yuan, Xue-Cheng Tai
CORR
2006
Springer
130views Education» more  CORR 2006»
13 years 8 months ago
On optimal quantization rules for some sequential decision problems
We consider the problem of sequential decentralized detection, a problem that entails several interdependent choices: the choice of a stopping rule (specifying the sample size), a...
XuanLong Nguyen, Martin J. Wainwright, Michael I. ...
INFOCOM
2010
IEEE
13 years 7 months ago
Markov Approximation for Combinatorial Network Optimization
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
Minghua Chen, Soung Chang Liew, Ziyu Shao, Caihong...
CVIU
2008
180views more  CVIU 2008»
13 years 8 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...