Sciweavers

2105 search results - page 376 / 421
» Graph Based Image Matching
Sort
View
VLSM
2005
Springer
14 years 3 months ago
Trimap Segmentation for Fast and User-Friendly Alpha Matting
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
Olivier Juan, Renaud Keriven
JEI
2007
144views more  JEI 2007»
13 years 9 months ago
Cost-based closed-contour representations
This paper presents an efficient technique for linking edge points in order to generate a closed-contour representation. It is based on the consecutive use of global and local sch...
Angel Domingo Sappa, Boris Xavier Vintimilla
ECCV
2006
Springer
14 years 11 months ago
Robust Multi-body Motion Tracking Using Commute Time Clustering
Abstract. The presence of noise renders the classical factorization method almost impractical for real-world multi-body motion tracking problems. The main problem stems from the ef...
Huaijun Qiu, Edwin R. Hancock
EMMCVPR
2001
Springer
14 years 2 months ago
An Experimental Comparison of Min-cut/Max-flow Algorithms for Energy Minimization in Vision
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
Yuri Boykov, Vladimir Kolmogorov
CORR
2012
Springer
272views Education» more  CORR 2012»
12 years 5 months ago
Fast and Exact Top-k Search for Random Walk with Restart
Graphs are fundamental data structures and have been employed for centuries to model real-world systems and phenomena. Random walk with restart (RWR) provides a good proximity sco...
Yasuhiro Fujiwara, Makoto Nakatsuji, Makoto Onizuk...