Sciweavers

ICCV
2005
IEEE
15 years 1 months ago
A Graph Cut Algorithm for Generalized Image Deconvolution
The goal of deconvolution is to recover an image x from its convolution with a known blurring function. This is equivalent to inverting the linear system y = Hx. In this paper we ...
Ashish Raj, Ramin Zabih
ICCV
2007
IEEE
15 years 1 months ago
Capacity Scaling for Graph Cuts in Vision
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
Olivier Juan, Yuri Boykov
CVPR
2005
IEEE
15 years 1 months ago
Energy Minimization via Graph Cuts: Settling What is Possible
The recent explosion of interest in graph cut methods in computer vision naturally spawns the question: what energy functions can be minimized via graph cuts? This question was fi...
Daniel Freedman, Petros Drineas