Sciweavers

742 search results - page 32 / 149
» Pattern matching for sets of segments
Sort
View
GBRPR
2009
Springer
15 years 6 months ago
Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors
In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacia...
David Knossow, Avinash Sharma, Diana Mateus, Radu ...
CVPR
2003
IEEE
16 years 1 months ago
Word Image Matching Using Dynamic Time Warping
Libraries and other institutions are interested in providing access to scanned versions of their large collections of handwritten historical manuscripts on electronic media. Conve...
Toni M. Rath, R. Manmatha
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 1 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...
CVPR
2010
IEEE
1341views Computer Vision» more  CVPR 2010»
15 years 8 months ago
Unsupervised Detection and Segmentation of Identical Objects
We address an unsupervised object detection and segmentation problem that goes beyond the conventional assumptions of one-to-one object correspondences or model-test settings betwe...
Minsu Cho (Seoul National University), Young Min S...
CVPR
2005
IEEE
16 years 1 months ago
Fast Spatial Pattern Discovery Integrating Boosting with Constellations of Contextual Descriptors
We present a novel approach for fast object class recognition incorporating contextual information into boosting. The object is represented as a constellation of generalized corre...
Jaume Amores, Nicu Sebe, Petia Radeva