Sciweavers

906 search results - page 105 / 182
» Matching Subsequences in Trees
Sort
View
GBRPR
2007
Springer
14 years 3 months ago
Graph-Based Methods for Retinal Mosaicing and Vascular Characterization
In this paper, we propose a highly robust point-matching method (Graph Transformation Matching - GTM) relying on finding the consensus graph emerging from putative matches. Such m...
Wendy Aguilar, M. Elena Martínez-Pér...
3DPVT
2006
IEEE
257views Visualization» more  3DPVT 2006»
14 years 3 months ago
3D from Line Segments in Two Poorly-Textured, Uncalibrated Images
This paper addresses the problem of camera selfcalibration, bundle adjustment and 3D reconstruction from line segments in two images of poorly-textured indoor scenes. First, we ge...
Herbert Bay, Andreas Ess, Alexander Neubeck, Luc J...
WADS
2005
Springer
114views Algorithms» more  WADS 2005»
14 years 2 months ago
Linear Time Algorithms for Generalized Edge Dominating Set Problems
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
André Berger, Ojas Parekh
TKDE
2011
363views more  TKDE 2011»
13 years 4 months ago
Efficient Techniques for Online Record Linkage
—The need to consolidate the information contained in heterogeneous data sources has been widely documented in recent years. In order to accomplish this goal, an organization mus...
Debabrata Dey, Vijay S. Mookerjee, Dengpan Liu
CVPR
2012
IEEE
11 years 11 months ago
Computing nearest-neighbor fields via Propagation-Assisted KD-Trees
Matching patches between two images, also known as computing nearest-neighbor fields, has been proven a useful technique in various computer vision/graphics algorithms. But this ...
Kaiming He, Jian Sun