905 search results - page 10 / 181 » On the Complexity of uSPR Distance |
CVPR
1998
IEEE
14 years 9 months ago
1998
IEEE
The Euclidean skeleton is essential for general shape representation. This paper provides an e cient method to extract a well-connected Euclidean skeleton by a neighbor bisector d...
ISAAC
2007
Springer
14 years 1 months ago
2007
Springer
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract-- This paper addresses the issue of design of lowrate sparse-graph codes with linear minimum distance in the blocklength. First, we define a necessary condition which need...
ICIP
2009
IEEE
14 years 7 months ago
2009
IEEE
This paper presents a novel approach for estimating the shortest
Euclidean distance from a given point to the corresponding
implicit quadric fitting surface. It first estimates t...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
Many computer vision algorithms make use of local features, and rely on a systematic comparison of these features. The chosen dissimilarity measure is of crucial importance for th...