Sciweavers

256 search results - page 42 / 52
» Graph cut based segmentation of convoluted objects
Sort
View
ACCV
2010
Springer
13 years 2 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
TCC
2012
Springer
218views Cryptology» more  TCC 2012»
12 years 3 months ago
Iterative Constructions and Private Data Release
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
Anupam Gupta, Aaron Roth, Jonathan Ullman
CVPR
2007
IEEE
14 years 9 months ago
Learning and Matching Line Aspects for Articulated Objects
Traditional aspect graphs are topology-based and are impractical for articulated objects. In this work we learn a small number of aspects, or prototypical views, from video data. ...
Xiaofeng Ren
CVPR
2007
IEEE
13 years 11 months ago
Inferring 3D Volumetric Shape of Both Moving Objects and Static Background Observed by a Moving Camera
We present a novel approach to inferring 3D volumetric shape of both moving objects and static background from video sequences shot by a moving camera, with the assumption that th...
Chang Yuan, Gérard G. Medioni
CVPR
2007
IEEE
14 years 9 months ago
Optimizing Binary MRFs via Extended Roof Duality
Many computer vision applications rely on the efficient optimization of challenging, so-called non-submodular, binary pairwise MRFs. A promising graph cut based approach for optim...
Carsten Rother, Vladimir Kolmogorov, Victor S. Lem...