3791 search results - page 361 / 759 » Packing sets of patterns |
137
Voted
ICIP
2007
IEEE
16 years 6 months ago
2007
IEEE
This paper presents a probabilistic framework for computing correspondences and fundamental matrix in the structure from motion problem. Inspired by Moisan and Stival [1], we sugg...
115
click to vote
ICIP
2001
IEEE
16 years 6 months ago
2001
IEEE
In this paper we propose a new watermarking technique where the watermark is embedded according to two keys. The first key is used to embed a code bit in a block of pixels. The se...
126
Voted
ICPR
2004
IEEE
16 years 5 months ago
2004
IEEE
A very common type of a-priori knowledge in pattern analysis problems is invariance of the input data with respect to transformation groups, e.g. geometric transformations of imag...
128
Voted
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
The k q-flats algorithm is a generalization of the popular k-means algorithm where q dimensional best fit affine sets replace centroids as the cluster prototypes. In this work, a ...
121
click to vote
KDD
2004
ACM
16 years 5 months ago
2004
ACM
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...