Sciweavers

396 search results - page 7 / 80
» A Graph Cut Algorithm for Generalized Image Deconvolution
Sort
View
IBPRIA
2007
Springer
14 years 1 months ago
Blind Estimation of Motion Blur Parameters for Image Deconvolution
Abstract. This paper describes an approach to estimate the parameters of a motion blur (direction and length) directly form the observed image. The motion blur estimate can then be...
João P. Oliveira, Mário A. T. Figuei...
CVPR
2011
IEEE
13 years 3 months ago
Biased Normalized Cuts
We present a modification of “Normalized Cuts” to incorporate priors which can be used for constrained image segmentation. Compared to previous generalizations of “Normaliz...
Subhransu Maji, Nisheeth Vishnoi, Jitendra Malik
WADS
2009
Springer
256views Algorithms» more  WADS 2009»
14 years 2 months ago
Dynamic Graph Clustering Using Minimum-Cut Trees
Abstract. Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering ...
Robert Görke, Tanja Hartmann, Dorothea Wagner
MM
2006
ACM
103views Multimedia» more  MM 2006»
14 years 1 months ago
Progressive cut
Recently, interactive image cutout technique becomes prevalent for image segmentation problem due to its easy-to-use nature. However, most existing stroke-based interactive object...
Chao Wang, Qiong Yang, Mo Chen, Xiaoou Tang, Zhong...
UAI
2004
13 years 8 months ago
Graph Partition Strategies for Generalized Mean Field Inference
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...
Eric P. Xing, Michael I. Jordan