Sciweavers

591 search results - page 100 / 119
» Computing fundamental groups from point clouds
Sort
View
PAMI
2006
98views more  PAMI 2006»
14 years 10 months ago
Integral Invariants for Shape Matching
For shapes represented as closed planar contours, we introduce a class of functionals which are invariant with respect to the Euclidean group and which are obtained by performing i...
Siddharth Manay, Daniel Cremers, Byung-Woo Hong, A...
ECCV
2004
Springer
16 years 20 days ago
Stereo Using Monocular Cues within the Tensor Voting Framework
We address the fundamental problem of matching in two static images. The remaining challenges are related to occlusion and lack of texture. Our approach addresses these difficultie...
Philippos Mordohai, Gérard G. Medioni
KDD
2000
ACM
149views Data Mining» more  KDD 2000»
15 years 2 months ago
Efficient clustering of high-dimensional data sets with application to reference matching
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
Andrew McCallum, Kamal Nigam, Lyle H. Ungar
IJCV
2002
185views more  IJCV 2002»
14 years 10 months ago
Vision and the Atmosphere
Current vision systems are designed to perform in clear weather. Needless to say, in any outdoor application, there is no escape from "bad" weather. Ultimately, computer ...
Srinivasa G. Narasimhan, Shree K. Nayar
CIVR
2008
Springer
125views Image Analysis» more  CIVR 2008»
15 years 17 days ago
Leveraging user query log: toward improving image data clustering
Image clustering is useful in many retrieval and classification applications. The main goal of image clustering is to partition a given dataset into salient clusters such that the...
Hao Cheng, Kien A. Hua, Khanh Vu