253 search results - page 25 / 51 » Faster Approximation of Distances in Graphs |
Publication
"This paper presents an efficient algorithm for solving one sort of region-based active contour models, i.e. the active contours without edges model. We develop the link betwe...
EMMCVPR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Meaningful notions of distance between planar shapes typically involve the computation of a correspondence between points on one shape and points on the other. To determi...
ADBIS
2007
Springer
14 years 1 months ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
ICTAI
2008
IEEE
14 years 1 months ago
2008
IEEE
—The dynamics of many systems are described by ordinary differential equations (ODE). Solving ODEs with standard methods (i.e. numerical integration) needs a high amount of compu...
CG
2004
Springer
13 years 7 months ago
2004
Springer
We present a new definition of an implicit surface over a noisy point cloud, based on the weighted least squares approach. It can be evaluated very fast, but artifacts are signifi...