105 search results - page 7 / 21 » Fast mesh segmentation using random walks |
112
Voted
CVPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper we propose a novel approach to the perceptual interpretation of building facades that combines shape grammars, supervised classification and random walks. Procedural...
120
Voted
FOCS
2006
IEEE
15 years 7 months ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
111
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
Network querying aims to search a large network for subnetwork regions that are similar to a given query network. In this paper, we propose a novel algorithm for querying large sc...
99
Voted
FOCS
1999
IEEE
15 years 6 months ago
1999
IEEE
We present a randomized algorithm for computing portions of an arrangement of n arcs in the plane, each pair of which intersect in at most t points. We use this algorithm to perfo...
147
click to vote
MICCAI
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Deformable surface models are often represented as triangular meshes in image segmentation applications. For a fast and easily regularized deformation onto the target obj...