Sciweavers

6365 search results - page 813 / 1273
» Fast Local Computation Algorithms
Sort
View
BMVC
2010
15 years 5 months ago
Iterative Hyperplane Merging: A Framework for Manifold Learning
We present a framework for the reduction of dimensionality of a data set via manifold learning. Using the building blocks of local hyperplanes we show how a global manifold can be...
Harry Strange, Reyer Zwiggelaar
ECCV
2006
Springer
16 years 9 months ago
Accelerated Convergence Using Dynamic Mean Shift
Mean shift is an iterative mode-seeking algorithm widely used in pattern recognition and computer vision. However, its convergence is sometimes too slow to be practical. In this pa...
Kai Zhang, James T. Kwok, Ming Tang
205
Voted
MM
2005
ACM
122views Multimedia» more  MM 2005»
16 years 1 months ago
Image clustering with tensor representation
We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Xiaofei He, Deng Cai, Haifeng Liu, Jiawei Han
PAMI
2010
202views more  PAMI 2010»
15 years 6 months ago
DAISY: An Efficient Dense Descriptor Applied to Wide-Baseline Stereo
—In this paper, we introduce a local image descriptor, DAISY, which is very efficient to compute densely. We also present an EM-based algorithm to compute dense depth and occlusi...
Engin Tola, Vincent Lepetit, Pascal Fua
ICCV
2007
IEEE
16 years 9 months ago
Out-of-Core Bundle Adjustment for Large-Scale 3D Reconstruction
Large-scale 3D reconstruction has recently received much attention from the computer vision community. Bundle adjustment is a key component of 3D reconstruction problems. However,...
Kai Ni, Drew Steedly, Frank Dellaert