Sciweavers

2127 search results - page 124 / 426
» Computing large matchings fast
Sort
View
227
Voted
ICCV
2007
IEEE
16 years 5 months ago
Articulated Shape Matching Using Locally Linear Embedding and Orthogonal Alignment
In this paper we propose a method for matching articulated shapes represented as large sets of 3D points by aligning the corresponding embedded clouds generated by locally linear ...
Diana Mateus, Fabio Cuzzolin, Radu Horaud, Edmond ...
117
Voted
ICCV
2001
IEEE
16 years 5 months ago
Empirical Filter Estimation for Subpixel Interpolation and Matching
We study the low-level problem of predicting pixel intensities after subpixel image translations. This is a basic subroutine for image warping and super-resolution, and it has a c...
Bill Triggs
EUROCRYPT
2004
Springer
15 years 7 months ago
Efficient Private Matching and Set Intersection
We consider the problem of computing the intersection of private datasets of two parties, where the datasets contain lists of elements taken from a large domain. This problem has m...
Michael J. Freedman, Kobbi Nissim, Benny Pinkas
116
Voted
PAMI
1998
94views more  PAMI 1998»
15 years 3 months ago
Unconstrained Automatic Image Matching Using Multiresolutional Critical-Point Filters
—This paper proposes a novel method for matching images. The results can be used for a variety of applications: fully automatic morphing, object recognition, stereo photogrammetr...
Yoshihisa Shinagawa, Tosiyasu L. Kunii
ICIP
1999
IEEE
16 years 5 months ago
A Fast Algorithm for Rigid Structure from Image Sequences
The factorization method [1] is a feature-based approach to recover 3D rigid structure from motion. In [2], we extended their framework to recover a parametric description of the ...
Pedro M. Q. Aguiar, José M. F. Moura