Sciweavers

199 search results - page 2 / 40
» Combinatorial Constraints on Multiple Projections of a Set o...
Sort
View
WEBI
2010
Springer
13 years 3 months ago
DSP: Robust Semi-supervised Dimensionality Reduction Using Dual Subspace Projections
High-dimensional data usually incur learning deficiencies and computational difficulties. We present a novel semi-supervised dimensionality reduction technique that embeds high-dim...
Su Yan, Sofien Bouaziz, Dongwon Lee
IJISTA
2007
136views more  IJISTA 2007»
13 years 5 months ago
Optimisation-on-a-manifold for global registration of multiple 3D point sets
: We propose a novel algorithm to register multiple 3D point sets within a common reference frame simultaneously. Our approach performs an explicit optimisation on the manifold of ...
Shankar Krishnan, Pei Yean Lee, John B. Moore, Sur...
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
13 years 3 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
ICPR
2006
IEEE
14 years 6 months ago
Multiple Camera Calibration with Bundled Optimization using Silhouette Geometry Constraints
We propose a method of calibrating multiple camera systems that operates by adjusting the camera parameters and the 3D shape of objects onto silhouette observations. Our method em...
Akira Utsumi, Hirotake Yamazoe, Shinji Abe
DCG
2010
104views more  DCG 2010»
13 years 2 months ago
Vietoris-Rips Complexes of Planar Point Sets
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
Erin W. Chambers, Vin de Silva, Jeff Erickson, Rob...