Sciweavers

387 search results - page 10 / 78
» Robust locally linear embedding
Sort
View
NIPS
2003
14 years 11 months ago
Locality Preserving Projections
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...
Xiaofei He, Partha Niyogi
ICDAR
2007
IEEE
15 years 4 months ago
Quantile Linear Algorithm for Robust Binarization of Digitalized Letters
We describe a threshold-based local algorithm for image binarization. The main idea is to compute a transition energy using pixel value differences taken from a neighborhood aroun...
M. Ramírez, Ernesto Tapia, Marco Block, Ra&...
ICRA
1998
IEEE
110views Robotics» more  ICRA 1998»
15 years 1 months ago
Generating Robust Trajectories in the Presence of Ordinary and Linear-Self-Motion Singularities
An algorithm is presented which computes feasible manipulator trajectories along fixed paths in the presence of kinematic singularities. The resulting trajectories are close to mi...
John E. Lloyd, Vincent Hayward
67
Voted
ICCV
2007
IEEE
15 years 11 months ago
Discriminant Embedding for Local Image Descriptors
Invariant feature descriptors such as SIFT and GLOH have been demonstrated to be very robust for image matching and visual recognition. However, such descriptors are generally par...
Gang Hua, Matthew Brown, Simon A. J. Winder
ECCV
2004
Springer
15 years 11 months ago
Transformation-Invariant Embedding for Image Analysis
Abstract. Dimensionality reduction is an essential aspect of visual processing. Traditionally, linear dimensionality reduction techniques such as principle components analysis have...
Ali Ghodsi, Jiayuan Huang, Dale Schuurmans