396 search results - page 26 / 80 » A Graph Cut Algorithm for Generalized Image Deconvolution |
JGO
2010
13 years 6 months ago
2010
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
MICCAI
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. This paper describes a new segmentation technique for multidimensional dynamic data. One example of such data is a perfusion sequence where a number of 3D MRI volumes sho...
ECCV
2004
Springer
14 years 9 months ago
2004
Springer
The problem of interactive foreground/background segmentation in still images is of great practical importance in image editing. The state of the art in interactive segmentation is...
STOC
2007
ACM
14 years 7 months ago
2007
ACM
Semidefinite programs (SDP) have been used in many recent approximation algorithms. We develop a general primal-dual approach to solve SDPs using a generalization of the well-know...
TOG
2008
13 years 7 months ago
2008
Video, like images, should support content aware resizing. We present video retargeting using an improved seam carving operator. Instead of removing 1D seams from 2D images we rem...