Sciweavers

616 search results - page 2 / 124
» Local Feature Matching Using Entropic Graphs
Sort
View
CAS
2008
118views more  CAS 2008»
13 years 5 months ago
A Novel Method for Measuring the Structural Information Content of Networks
In this paper we first present a novel approach to determine the structural information content (graph entropy) of a network represented by an undirected and connected graph. Such...
Matthias Dehmer
CVPR
2004
IEEE
14 years 7 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
CVPR
2005
IEEE
14 years 7 months ago
Object Detection Using 2D Spatial Ordering Constraints
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...
Yan Li, Yanghai Tsin, Yakup Genc, Takeo Kanade
JMM2
2007
127views more  JMM2 2007»
13 years 5 months ago
Robust Face Recognition through Local Graph Matching
— A novel face recognition method is proposed, in which face images are represented by a set of local labeled graphs, each containing information about the appearance and geometr...
Ehsan Fazl Ersi, John S. Zelek, John K. Tsotsos
CVPR
2012
IEEE
11 years 7 months ago
Image matching using local symmetry features
We present a new technique for extracting local features from images of architectural scenes, based on detecting and representing local symmetries. These new features are motivate...
Daniel Cabrini Hauagge, Noah Snavely