Sciweavers

2938 search results - page 129 / 588
» On obfuscating point functions
Sort
View
CVPR
2004
IEEE
16 years 8 months ago
A New GPCA Algorithm for Clustering Subspaces by Fitting, Differentiating and Dividing Polynomials
We consider the problem of clustering data lying on multiple subspaces of unknown and possibly different dimensions. We show that one can represent the subspaces with a set of pol...
Jacopo Piazzi, René Vidal, Yi Ma
ICCV
2005
IEEE
16 years 8 months ago
Geometric Invariants and Applications under Catadioptric Camera Model
This paper presents geometric invariants of points and their applications under central catadioptric camera model. Although the image has severe distortions under the model, we es...
Yihong Wu, Zhanyi Hu
ICML
2002
IEEE
16 years 7 months ago
Univariate Polynomial Inference by Monte Carlo Message Length Approximation
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...
Leigh J. Fitzgibbon, David L. Dowe, Lloyd Allison
MMM
2007
Springer
123views Multimedia» more  MMM 2007»
16 years 20 days ago
Tamper Proofing 3D Motion Data Streams
This paper presents a fragile watermarking technique to tamper proof (Mocap) motion capture data. The technique visualizes 3D Mocap data as a series of cluster of points. Watermark...
Parag Agarwal, Balakrishnan Prabhakaran
WADS
2007
Springer
68views Algorithms» more  WADS 2007»
16 years 15 days ago
On Euclidean Vehicle Routing with Allocation
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
Jan Remy, Reto Spöhel, Andreas Weißl