Sciweavers

511 search results - page 21 / 103
» The intrinsic dimensionality of graphs
Sort
View
CVPR
2008
IEEE
14 years 12 months ago
A unified framework for generalized Linear Discriminant Analysis
Linear Discriminant Analysis (LDA) is one of the wellknown methods for supervised dimensionality reduction. Over the years, many LDA-based algorithms have been developed to cope w...
Shuiwang Ji, Jieping Ye
ECCV
2006
Springer
14 years 11 months ago
Learning Nonlinear Manifolds from Time Series
Abstract. There has been growing interest in developing nonlinear dimensionality reduction algorithms for vision applications. Although progress has been made in recent years, conv...
Ruei-Sung Lin, Che-Bin Liu, Ming-Hsuan Yang, Naren...
NIPS
2004
13 years 11 months ago
Two-Dimensional Linear Discriminant Analysis
Linear Discriminant Analysis (LDA) is a well-known scheme for feature extraction and dimension reduction. It has been used widely in many applications involving high-dimensional d...
Jieping Ye, Ravi Janardan, Qi Li
DAGSTUHL
2007
13 years 11 months ago
Graph matching with type constraints on nodes and edges
Abstract. In this paper, we consider two particular problems of directed graph matching. The first problem concerns graphs with nodes that have been subdivided into classes of di...
Catherine Fraikin, Paul Van Dooren
GBRPR
2005
Springer
14 years 3 months ago
Pyramids of n-Dimensional Generalized Maps
Graph pyramids are often used for representing irregular image pyramids. For the 2D case, combinatorial pyramids have been recently defined in order to explicitly represent more ...
Carine Grasset-Simon, Guillaume Damiand, Pascal Li...