105 search results - page 7 / 21 » Fast mesh segmentation using random walks |
CVPR
2010
IEEE
14 years 4 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...
FOCS
2006
IEEE
14 years 1 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...
ICASSP
2011
IEEE
12 years 11 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...
FOCS
1999
IEEE
14 years 3 days 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...
MICCAI
2010
Springer
13 years 5 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...