Sciweavers

203 search results - page 6 / 41
» Random walks on graphs to model saliency in images
Sort
View
MM
2006
ACM
190views Multimedia» more  MM 2006»
16 years 1 days ago
Image annotation refinement using random walk with restarts
Image annotation plays an important role in image retrieval and management. However, the results of the state-of-the-art image annotation methods are often unsatisfactory. Therefo...
Changhu Wang, Feng Jing, Lei Zhang, HongJiang Zhan...
ECCV
2008
Springer
16 years 10 months ago
Generative Image Segmentation Using Random Walks with Restart
We consider the problem of multi-label, supervised image segmentation when an initial labeling of some pixels is given. In this paper, we propose a new generative image segmentatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
CSDA
2010
118views more  CSDA 2010»
15 years 6 months ago
Grapham: Graphical models with adaptive random walk Metropolis algorithms
Recently developed adaptive Markov chain Monte Carlo (MCMC) methods have been applied successfully to many problems in Bayesian statistics. Grapham is a new open source implementat...
Matti Vihola
MIR
2005
ACM
140views Multimedia» more  MIR 2005»
15 years 11 months ago
Multiple random walk and its application in content-based image retrieval
In this paper, we propose a transductive learning method for content-based image retrieval: Multiple Random Walk (MRW). Its basic idea is to construct two generative models by mea...
Jingrui He, Hanghang Tong, Mingjing Li, Wei-Ying M...
CVPR
2007
IEEE
16 years 8 months ago
Image Matching via Saliency Region Correspondences
We introduce the notion of co-saliency for image matching. Our matching algorithm combines the discriminative power of feature correspondences with the descriptive power of matchi...
Alexander Toshev, Jianbo Shi, Kostas Daniilidis