Sciweavers

16 search results - page 3 / 4
» Mapping for Iterative MMSE-SIC with Belief Propagation
Sort
View
CVPR
2006
IEEE
14 years 9 months ago
Solving Markov Random Fields using Second Order Cone Programming Relaxations
This paper presents a generic method for solving Markov random fields (MRF) by formulating the problem of MAP estimation as 0-1 quadratic programming (QP). Though in general solvi...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
CVPR
2008
IEEE
14 years 9 months ago
Stereo reconstruction with mixed pixels using adaptive over-segmentation
We present an over-segmentation based, dense stereo algorithm that jointly estimates segmentation and depth. For mixed pixels on segment boundaries, the algorithm computes foregro...
Yuichi Taguchi, Bennett Wilburn, C. Lawrence Zitni...
CVPR
2010
IEEE
14 years 3 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler
RSS
2007
198views Robotics» more  RSS 2007»
13 years 9 months ago
CRF-Matching: Conditional Random Fields for Feature-Based Scan Matching
— Matching laser range scans observed at different points in time is a crucial component of many robotics tasks, including mobile robot localization and mapping. While existing t...
Fabio T. Ramos, Dieter Fox, Hugh F. Durrant-Whyte
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 7 months ago
Message-passing for Maximum Weight Independent Set
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
Sujay Sanghavi, Devavrat Shah, Alan S. Willsky