Sciweavers

280 search results - page 49 / 56
» Approximate nearest neighbors using sparse representations
Sort
View
ECCV
2008
Springer
15 years 11 months ago
SIFT Flow: Dense Correspondence across Different Scenes
While image registration has been studied in different areas of computer vision, aligning images depicting different scenes remains a challenging problem, closer to recognition tha...
Ce Liu, Jenny Yuen, Antonio B. Torralba, Josef Siv...
SWAP
2008
14 years 11 months ago
A Note on the Evaluation of Inductive Concept Classification Procedures
Abstract. The limitations of deductive logic-based approaches at deriving operational knowledge from ontologies may be overcome by inductive (instancebased) methods, which are usua...
Claudia d'Amato, Nicola Fanizzi, Floriana Esposito
COMPGEOM
2011
ACM
14 years 1 months ago
Comparing distributions and shapes using the kernel distance
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
ICPR
2008
IEEE
15 years 4 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
CIMAGING
2010
195views Hardware» more  CIMAGING 2010»
14 years 11 months ago
SPIRAL out of convexity: sparsity-regularized algorithms for photon-limited imaging
The observations in many applications consist of counts of discrete events, such as photons hitting a detector, which cannot be effectively modeled using an additive bounded or Ga...
Zachary T. Harmany, Roummel F. Marcia, Rebecca Wil...