Sciweavers

595 search results - page 62 / 119
» Multi-robot Markov random fields
Sort
View
PAMI
2007
176views more  PAMI 2007»
14 years 9 months ago
Approximate Labeling via Graph Cuts Based on Linear Programming
A new framework is presented for both understanding and developing graph-cut based combinatorial algorithms suitable for the approximate optimization of a very wide class of MRFs ...
Nikos Komodakis, Georgios Tziritas
PAMI
2010
160views more  PAMI 2010»
14 years 8 months ago
Photometric Stereo via Expectation Maximization
—This paper presents a robust and automatic approach to photometric stereo, where the two main components, namely surface normals and visible surfaces, are respectively optimized...
Tai-Pang Wu, Chi-Keung Tang
CIARP
2009
Springer
14 years 7 months ago
A Computer-Assisted Colorization Approach Based on Efficient Belief Propagation and Graph Matching
Abstract. Region-based approaches have been proposed to computerassisted colorization problem, typically using shape similarity and topology relations between regions. Given a colo...
Alexandre Noma, Luiz Velho, Roberto M. Cesar
CVPR
2011
IEEE
14 years 5 months ago
Global Stereo Matching Leveraged by Sparse Ground Control Points
We present a novel global stereo model that makes use of constraints from points with known depths, i.e., the Ground Control Points (GCPs) as referred to in stereo literature. Our...
Liang Wang, Ruigang Yang
CVPR
2007
IEEE
15 years 11 months ago
Discriminative Learning of Dynamical Systems for Motion Tracking
We introduce novel discriminative learning algorithms for dynamical systems. Models such as Conditional Random Fields or Maximum Entropy Markov Models outperform the generative Hi...
Minyoung Kim, Vladimir Pavlovic