465 search results - page 74 / 93 » An Efficient Parallel Algorithm for Graph-Based Image Segmen... |
109
click to vote
ECCV
2008
Springer
15 years 11 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
135
click to vote
TSMC
2008
14 years 9 months ago
2008
We present a method for the recovery of partially occluded 3D geometric primitives from range images which might also include non-primitive objects. The method uses a technique for...
TIP
2010
14 years 4 months ago
2010
In this paper, we present a fast algorithm for filling unknown regions in an image using the strategy of exemplarmatching. Unlike the original exemplar-based method using exhaustiv...
SI3D
2010
ACM
14 years 10 months ago
2010
ACM
We introduce a real-time system that converts images, video, or 3D animation sequences to artistic renderings in various painterly styles. The algorithm, which is entirely execute...
HIS
2001
14 years 11 months ago
2001
An algorithm has been developed for the detection of point targets in uncluttered background based on a Bayesian track before detect method. The algorithm has an application in th...