Sciweavers

470 search results - page 52 / 94
» Local properties of geometric graphs
Sort
View
SMI
2006
IEEE
152views Image Analysis» more  SMI 2006»
15 years 5 months ago
A Laplacian Based Approach for Free-Form Deformation of Sparse Low-degree IMplicit Surfaces
Sparse Low-degree IMplicit (SLIM) surface [11] is a recently developed non-conforming surface representation. In this paper, a method for free-form deformation of SLIM surfaces is...
Yutaka Ohtake, Takashi Kanai, Kiwamu Kase
MIR
2004
ACM
236views Multimedia» more  MIR 2004»
15 years 5 months ago
Boosting contextual information in content-based image retrieval
We present a new framework for characterizing and retrieving objects in cluttered scenes. This CBIR system is based on a new representation describing every object taking into acc...
Jaume Amores, Nicu Sebe, Petia Radeva, Theo Gevers...
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 3 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
PR
2007
141views more  PR 2007»
14 years 11 months ago
A Riemannian approach to graph embedding
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...
Antonio Robles-Kelly, Edwin R. Hancock
PAMI
2010
139views more  PAMI 2010»
14 years 10 months ago
Order-Preserving Moves for Graph-Cut-Based Optimization
— In the last decade, graph-cut optimization has been popular for a variety of labeling problems. Typically graph-cut methods are used to incorporate smoothness constraints on a ...
Xiaoqing Liu, Olga Veksler, Jagath Samarabandu