Sciweavers

283 search results - page 9 / 57
» Versatile spectral methods for point set matching
Sort
View
CVPR
2011
IEEE
13 years 3 months ago
Graph Embedding Discriminant Analysis on Grassmannian Manifolds for Improved Image Set Matching
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...
Mehrtash Harandi, Sareh, Shirazi (National ICT Aus...
DAGSTUHL
2006
13 years 8 months ago
Many-to-Many Feature Matching in Object Recognition
One of the bottlenecks of current recognition (and graph matching) systems is their assumption of one-to-one feature (node) correspondence. This assumption breaks down in the gener...
Ali Shokoufandeh, Yakov Keselman, M. Fatih Demirci...
UAI
2003
13 years 8 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey
ICPR
2010
IEEE
13 years 10 months ago
Triangle-Constraint for Finding More Good Features
We present a novel method for finding more good feature pairs between two sets of features. We first select matched features by Bi-matching method as seed points, then organize th...
Xiaojie Guo, Xiaochun Cao
RT
2004
Springer
14 years 21 days ago
A Spectral-particle hybrid method for rendering falling snow
Falling snow has the visual property that it is simultaneously a set of discrete moving particles as well as a dynamic texture. To capture the dynamic texture properties of fallin...
Michael S. Langer, Linqiao Zhang, Allison W. Klein...