Sciweavers

1825 search results - page 76 / 365
» Local Dimensionality Reduction
Sort
View
ICPR
2000
IEEE
15 years 2 months ago
Piecewise Linear Two-Dimensional Warping
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
Seiichi Uchida, Hiroaki Sakoe
PCM
2004
Springer
99views Multimedia» more  PCM 2004»
15 years 3 months ago
Indexing Issues in Supporting Similarity Searching
Indexing issues that arise in the support of similarity searching are presented. This includes a discussion of the curse of dimensionality, as well as multidimensional indexing, di...
Hanan Samet
PSIVT
2009
Springer
400views Multimedia» more  PSIVT 2009»
15 years 4 months ago
Local Image Descriptors Using Supervised Kernel ICA
PCA-SIFT is an extension to SIFT which aims to reduce SIFT’s high dimensionality (128 dimensions) by applying PCA to the gradient image patches. However PCA is not a discriminati...
Masaki Yamazaki, Sidney Fels
GECCO
2009
Springer
127views Optimization» more  GECCO 2009»
15 years 2 months ago
BBOB-benchmarking the Rosenbrock's local search algorithm
The restarted Rosenbrock’s optimization algorithm is tested on the BBOB 2009 testbed. The algorithm turned out to be very efficient for functions with simple structure (independ...
Petr Posik
CVPR
2010
IEEE
15 years 5 months ago
Highly Accurate Boundary Detection and Grouping
In this work we address boundary detection and boundary grouping. We first pursue a learning-based approach to boundary detection. For this (i) we leverage appearance and context...
Iasonas Kokkinos