Sciweavers

105 search results - page 12 / 21
» Fast mesh segmentation using random walks
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Image annotation refinement using semantic similarity correlation
Automatic image annotation is a promising way to achieve more effective image management and retrieval by using keywords. However, system performances of the existing state-of-the...
Songhao Zhu, Yuncai Liu
ICIP
2010
IEEE
13 years 5 months ago
Randomized motion estimation
Motion estimation is known to be a non-convex optimization problem. This non-convexity comes from several ambiguities in motion estimation such as the aperture problem, or fast mo...
Sylvain Boltz, Frank Nielsen
ACCV
2010
Springer
13 years 2 months ago
Four Color Theorem for Fast Early Vision
Recent work on early vision such as image segmentation, image restoration, stereo matching, and optical flow models these problems using Markov Random Fields. Although this formula...
Radu Timofte, Luc J. Van Gool
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 8 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
WSC
2000
13 years 9 months ago
Simulating GI/GI/1 queues and insurance risk processes with subexponential distributions
This paper deals with estimating small tail probabilities of the steady-state waiting time in a GI/GI/1 queue with heavy-tailed (subexponential) service times. The problem of esti...
Nam Kyoo Boots, Perwez Shahabuddin