Sciweavers

62 search results - page 7 / 13
» On Nearest-Neighbor Graphs
Sort
View
CVPR
2004
IEEE
14 years 11 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
ISNN
2005
Springer
14 years 3 months ago
Advanced Visualization Techniques for Self-organizing Maps with Graph-Based Methods
The Self-Organizing Map is a popular neural network model for data analysis, for which a wide variety of visualization techniques exists. We present a novel technique that takes th...
Georg Pölzlbauer, Andreas Rauber, Michael Dit...
ICDAR
2003
IEEE
14 years 3 months ago
Classification of Web Documents Using a Graph Model
In this paper we describe work relating to classification of web documents using a graph-based model instead of the traditional vector-based model for document representation. We ...
Adam Schenker, Mark Last, Horst Bunke, Abraham Kan...
DAGM
2004
Springer
14 years 3 months ago
Pixel-to-Pixel Matching for Image Recognition Using Hungarian Graph Matching
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suita...
Daniel Keysers, Thomas Deselaers, Hermann Ney
JMLR
2010
367views more  JMLR 2010»
13 years 4 months ago
Locally Linear Denoising on Image Manifolds
We study the problem of image denoising where images are assumed to be samples from low dimensional (sub)manifolds. We propose the algorithm of locally linear denoising. The algor...
Dian Gong, Fei Sha, Gérard G. Medioni