Sciweavers

2827 search results - page 281 / 566
» Robustness of PSPACE-complete sets
Sort
View
ICIP
2008
IEEE
16 years 6 months ago
Principal Component Analysis of spectral coefficients for mesh watermarking
This paper proposes a new robust 3-D object blind watermarking method using constraints in the spectral domain. Mesh watermarking in spectral domain has the property of spreading ...
Ming Luo, Adrian G. Bors
ICIP
2005
IEEE
16 years 6 months ago
Shape contexts and Gabor features for face description and authentication
In this paper, we use a robust shape matching algorithm for stablishing correspondences between points from face images, and Gabor vectors (jets) for feature computation. After ex...
Daniel González-Jiménez, José...
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
16 years 5 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
MICCAI
2007
Springer
16 years 5 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...
SIGMOD
2004
ACM
154views Database» more  SIGMOD 2004»
16 years 4 months ago
Computing Clusters of Correlation Connected Objects
The detection of correlations between different features in a set of feature vectors is a very important data mining task because correlation indicates a dependency between the fe...
Christian Böhm, Karin Kailing, Peer Krög...