Sciweavers

1801 search results - page 171 / 361
» Pointing without a pointer
Sort
View
JMIV
2007
143views more  JMIV 2007»
14 years 10 months ago
Measures for Benchmarking of Automatic Correspondence Algorithms
Automatic localisation of correspondences for the construction of Statistical Shape Models from examples has been the focus of intense research during the last decade. Several alg...
Anders Ericsson, Johan Karlsson
RC
1998
82views more  RC 1998»
14 years 10 months ago
A Note on Epsilon-Inflation
Abstract. The epsilon-inflation proved to be useful and necessary in many verification algorithms. Different definitions of an epsilon-inflation are possible, depending on the...
Siegfried M. Rump
VLDB
2002
ACM
138views Database» more  VLDB 2002»
14 years 10 months ago
Adaptable Similarity Search using Non-Relevant Information
Many modern database applications require content-based similarity search capability in numeric attribute space. Further, users' notion of similarity varies between search se...
T. V. Ashwin, Rahul Gupta, Sugata Ghosal
COMPGEOM
2011
ACM
14 years 2 months ago
Minors in random and expanding hypergraphs
We introduce a new notion of minors for simplicial complexes (hypergraphs), so-called homological minors. Our motivation is to propose a general approach to attack certain extrema...
Uli Wagner
ICCV
2007
IEEE
16 years 11 days ago
Consistent Correspondence between Arbitrary Manifold Surfaces
We propose a novel framework for consistent correspondence between arbitrary manifold meshes. Different from most existing methods, our approach directly maps the connectivity of ...
Huai-yu Wu, Chunhong Pan, Qing Yang, Songde Ma