Sciweavers

845 search results - page 46 / 169
» Complexity Dimensions and Learnability
Sort
View
APVIS
2010
14 years 7 months ago
Visual analysis of high dimensional point clouds using topological landscapes
In this paper, we present a novel three-stage process to visualize the structure of point clouds in arbitrary dimensions. To get insight into the structure and complexity of a dat...
Patrick Oesterling, Christian Heine, Heike Jä...
PR
2008
129views more  PR 2008»
15 years 19 days ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
CVPR
2012
IEEE
13 years 3 months ago
Geometric understanding of point clouds using Laplace-Beltrami operator
In this paper, we propose a general framework for approximating differential operator directly on point clouds and use it for geometric understanding on them. The discrete approxi...
Jian Liang, Rongjie Lai, Tsz Wai Wong, Hongkai Zha...
93
Voted
PODS
2000
ACM
120views Database» more  PODS 2000»
15 years 4 months ago
Indexing the Edges - A Simple and Yet Efficient Approach to High-Dimensional Indexing
In this paper, we propose a new tunable index scheme, called iMinMax , that maps points in high dimensional spaces to single dimension values determined by their maximum or minimu...
Beng Chin Ooi, Kian-Lee Tan, Cui Yu, Stépha...
IPCV
2008
15 years 2 months ago
Face Recognition using PCA and LDA with Singular Value Decomposition (SVD)
Linear Discriminant Analysis(LDA) is well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional data,...
Neeta Nain, Nitish Agarwal, Prashant Gour, Rakesh ...