Sciweavers

253 search results - page 6 / 51
» Principal Graphs and Manifolds
Sort
View
ECCV
2002
Springer
16 years 2 months ago
Representing Edge Models via Local Principal Component Analysis
Edge detection depends not only upon the assumed model of what an edge is, but also on how this model is represented. The problem of how to represent the edge model is typically ne...
Patrick S. Huggins, Steven W. Zucker
91
Voted
ECCV
2000
Springer
16 years 2 months ago
Non-linear Bayesian Image Modelling
In recent years several techniques have been proposed for modelling the low-dimensional manifolds, or `subspaces', of natural images. Examples include principal component anal...
Christopher M. Bishop, John M. Winn
ESANN
2007
15 years 2 months ago
Mixtures of robust probabilistic principal component analyzers
Mixtures of probabilistic principal component analyzers model high-dimensional nonlinear data by combining local linear models. Each mixture component is specifically designed to...
Cédric Archambeau, Nicolas Delannay, Michel...
90
Voted
PR
2007
88views more  PR 2007»
15 years 5 days ago
Robust kernel Isomap
Isomap is one of widely-used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional s...
Heeyoul Choi, Seungjin Choi
107
Voted
NIPS
2004
15 years 2 months ago
Proximity Graphs for Clustering and Manifold Learning
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
Miguel Á. Carreira-Perpiñán, ...