620 search results - page 74 / 124 » A Simple and Fast Min-cut Algorithm |
112
click to vote
ECCV
2004
Springer
15 years 3 months ago
2004
Springer
A novel method allowing simplified and efficient active surface initialization for 3D images segmentation is presented. Our method allows to initialize an active surface through si...
CLEF
2010
Springer
15 years 17 hour ago
2010
Springer
Image classification or annotation is proved difficult for the computer algorithms. The Naive-Bayes Nearest Neighbor method is proposed to tackle the problem, and achieved the stat...
SIGGRAPH
1998
ACM
15 years 4 months ago
1998
ACM
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough...
CW
2002
IEEE
15 years 4 months ago
2002
IEEE
In Reverse Engineering a physical object is digitally reconstructed from a set of boundary points. In the segmentation phase these points are grouped into subsets to facilitate co...
STACS
1992
Springer
15 years 3 months ago
1992
Springer
In this paper we give a practical and e cient output-sensitive algorithm for constructing the display of a polyhedral terrain. It runs in Od + nlog2 n time and uses On n space, wh...