Sciweavers

283 search results - page 8 / 57
» Versatile spectral methods for point set matching
Sort
View
TIFS
2010
103views more  TIFS 2010»
13 years 5 months ago
Addressing missing values in kernel-based multimodal biometric fusion using neutral point substitution
In multimodal biometric information fusion, it is common to encounter missing modalities in which matching cannot be performed. As a result, at the match score level, this implies...
Norman Poh, David Windridge, Vadim Mottl, Alexande...
PAMI
2011
12 years 10 months ago
Higher-Dimensional Affine Registration and Vision Applications
—Affine registration has a long and venerable history in computer vision literature, and in particular, extensive work has been done for affine registration in IR2 and IR3 . This...
S. M. Nejhum Shahed, Yu-Tseh Chi, Jeffrey Ho, Ming...
ICCV
2005
IEEE
14 years 9 months ago
A Spectral Technique for Correspondence Problems Using Pairwise Constraints
We present an efficient spectral method for finding consistent correspondences between two sets of features. We build the adjacency matrix M of a graph whose nodes represent the p...
Marius Leordeanu, Martial Hebert
SMI
2003
IEEE
131views Image Analysis» more  SMI 2003»
14 years 19 days ago
Watermarking 2D Vector Maps in the Mesh-Spectral Domain
This paper proposes a digital watermarking algorithm for 2D vector digital maps. The watermark is a robust, informed-detection watermark to be used to prevent such abuses as an in...
Ryutarou Ohbuchi, Hiroo Ueda, Shuh Endoh
SIGMOD
1999
ACM
183views Database» more  SIGMOD 1999»
13 years 11 months ago
OPTICS: Ordering Points To Identify the Clustering Structure
Cluster analysis is a primary method for database mining. It is either used as a stand-alone tool to get insight into the distribution of a data set, e.g. to focus further analysi...
Mihael Ankerst, Markus M. Breunig, Hans-Peter Krie...