Sciweavers

1100 search results - page 140 / 220
» Approximate distance oracles
Sort
View
CVPR
2000
IEEE
16 years 2 days ago
Reconstruction from Six-Point Sequences
An algorithm is given for computing projective structure from a set of six points seen in a sequence of many images. The method is based on the notion of duality between cameras a...
Richard I. Hartley, Nicolas Y. Dano
CVPR
2004
IEEE
16 years 2 days ago
Wide Baseline Feature Matching Using the Cross-Epipolar Ordering Constraint
? Robust feature matching across different views of the same scene taken by two cameras with wide baseline and arbitrary rotation is still an open problem. Matching based on appear...
Xiaoye Lu, Roberto Manduchi
CVPR
2008
IEEE
16 years 2 days ago
Shape prior segmentation of multiple objects with graph cuts
We present a new shape prior segmentation method using graph cuts capable of segmenting multiple objects. The shape prior energy is based on a shape distance popular with level se...
Nhat Vu, B. S. Manjunath
ICML
2008
IEEE
15 years 11 months ago
Nearest hyperdisk methods for high-dimensional classification
In high-dimensional classification problems it is infeasible to include enough training samples to cover the class regions densely. Irregularities in the resulting sparse sample d...
Hakan Cevikalp, Bill Triggs, Robi Polikar
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
15 years 10 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church