Sciweavers

396 search results - page 5 / 80
» A Graph Cut Algorithm for Generalized Image Deconvolution
Sort
View
SODA
2012
ACM
262views Algorithms» more  SODA 2012»
12 years 12 months ago
A polynomial-time approximation scheme for planar multiway cut
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
MohammadHossein Bateni, MohammadTaghi Hajiaghayi, ...
ICIP
2003
IEEE
15 years 11 months ago
A variational method for Bayesian blind image deconvolution
In this paper the blind image deconvolution (BID) problem is solved using the Bayesian framework. In order to find the parameters of the proposed Bayesian model we present a new g...
Aristidis Likas, Nikolas P. Galatsanos
98
Voted
ECCV
2002
Springer
15 years 11 months ago
Multi-camera Scene Reconstruction via Graph Cuts
We address the problem of computing the 3-dimensional shape of an arbitrary scene from a set of images taken at known viewpoints. Multi-camera scene reconstruction is a natural gen...
Vladimir Kolmogorov, Ramin Zabih
ICIP
2009
IEEE
14 years 7 months ago
A generalized vector-valued total variation algorithm
We propose a simple but flexible method for solving the generalized vector-valued TV (VTV) functional, which includes both the 2 -VTV and 1 -VTV regularizations as special cases, ...
Paul Rodriguez, Brendt Wohlberg
CVPR
2004
IEEE
15 years 11 months ago
Spatially Coherent Clustering Using Graph Cuts
Feature space clustering is a popular approach to image segmentation, in which a feature vector of local properties (such as intensity, texture or motion) is computed at each pixe...
Ramin Zabih, Vladimir Kolmogorov