Sciweavers

396 search results - page 4 / 80
» A Graph Cut Algorithm for Generalized Image Deconvolution
Sort
View
ICIP
2003
IEEE
14 years 9 months ago
Fast GEM wavelet-based image deconvolution algorithm
The paper proposes a new wavelet-based Bayesian approach to image deconvolution, under the space-invariant blur and additive white Gaussian noise assumptions. Image deconvolution ...
José M. Bioucas-Dias
PAMI
2007
202views more  PAMI 2007»
13 years 7 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
ICIP
2005
IEEE
14 years 1 months ago
A regularization framework for joint blur estimation and super-resolution of video sequences
In traditional digital image restoration, the blurring process of the optic is assumed known. Many previous research efforts have been trying to reconstruct the degraded image or ...
Hu He, Lisimachos P. Kondi
PAMI
2007
176views more  PAMI 2007»
13 years 7 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
CVPR
2007
IEEE
14 years 9 months ago
Graph Cut Based Optimization for MRFs with Truncated Convex Priors
Optimization with graph cuts became very popular in recent years. Progress in problems such as stereo correspondence, image segmentation, etc., can be attributed, in part, to the ...
Olga Veksler