Sciweavers

1872 search results - page 333 / 375
» The Art of Granular Computing
Sort
View
CGF
2011
13 years 1 months ago
Intrinsic Shape Matching by Planned Landmark Sampling
Recently, the problem of intrinsic shape matching has received a lot of attention. A number of algorithms have been proposed, among which random-sampling-based techniques have bee...
Art Tevs, Alexander Berner, Michael Wand, Ivo Ihrk...
CVPR
2003
IEEE
14 years 12 months ago
Joint Manifold Distance: a new approach to appearance based clustering
We wish to match sets of images to sets of images where both sets are undergoing various distortions such as viewpoint and lighting changes. To this end we have developed a Joint ...
Andrew W. Fitzgibbon, Andrew Zisserman
ECCV
2008
Springer
14 years 11 months ago
Automatic Generator of Minimal Problem Solvers
Abstract. Finding solutions to minimal problems for estimating epipolar geometry and camera motion leads to solving systems of algebraic equations. Often, these systems are not tri...
Martin Bujnak, Tomás Pajdla, Zuzana Kukelov...
DCC
2009
IEEE
14 years 10 months ago
Compressed Kernel Perceptrons
Kernel machines are a popular class of machine learning algorithms that achieve state of the art accuracies on many real-life classification problems. Kernel perceptrons are among...
Slobodan Vucetic, Vladimir Coric, Zhuang Wang
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
14 years 10 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales