Sciweavers

35 search results - page 2 / 7
» A convex programming approach for color stereo matching
Sort
View
ICASSP
2011
IEEE
12 years 8 months ago
Proximal splitting methods for depth estimation
Stereo matching is an active area of research in image processing. In a recent work, a convex programming approach was developed in order to generate a dense disparity field. In ...
Mireille El Gheche, Jean-Christophe Pesquet, Jouma...
CVPR
2011
IEEE
13 years 1 months ago
Object Stereo - Joint Stereo Matching and Object Segmentation
This paper presents a method for joint stereo matching and object segmentation. In our approach a 3D scene is represented as a collection of visually distinct and spatially cohere...
Michael Bleyer, Carsten Rother, Pushmeet Kohli, Da...
CRV
2006
IEEE
223views Robotics» more  CRV 2006»
13 years 11 months ago
Disparity Map Estimation Using A Total Variation Bound
This paper describes a new variational method for estimating disparity from stereo images. The stereo matching problem is formulated as a convex programming problem in which an ob...
Wided Miled, Jean-Christophe Pesquet
CVPR
2009
IEEE
15 years 4 days ago
A Stereo Approach that Handles the Matting Problem via Image Warping
We propose an algorithm that simultaneously extracts disparities and alpha matting information given a stereo image pair. Our method divides the reference image into a set of ov...
Michael Bleyer (Vienna University of Technology), ...
ISNN
2005
Springer
13 years 10 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu