Sciweavers

510 search results - page 58 / 102
» Adaptive Distances on Sets of Vectors
Sort
View
IGARSS
2009
14 years 7 months ago
Estimation and Segmentation in Non-Gaussian POLSAR Clutter by SIRV Stochastic Processes
In the context of non-Gaussian polarimetric clutter models, this paper presents an application of the recent advances in the field of Spherically Invariant Random Vectors (SIRV) m...
Gabriel Vasile, Jean Philippe Ovarlez, Fréd...
ICASSP
2011
IEEE
14 years 1 months ago
An inner-product lower-bound estimate for dynamic time warping
In this paper, we present a lower-bound estimate for dynamic time warping (DTW) on time series consisting of multi-dimensional posterior probability vectors known as posteriorgram...
Yaodong Zhang, James R. Glass
SIGMOD
2001
ACM
193views Database» more  SIGMOD 2001»
15 years 10 months ago
Epsilon Grid Order: An Algorithm for the Similarity Join on Massive High-Dimensional Data
The similarity join is an important database primitive which has been successfully applied to speed up applications such as similarity search, data analysis and data mining. The s...
Christian Böhm, Bernhard Braunmüller, Fl...
WSOM
2009
Springer
15 years 4 months ago
Analytic Comparison of Self-Organising Maps
Abstract. SOMs have proven to be a very powerful tool for data analysis. However, comparing multiple SOMs trained on the same data set using different parameters or initialisation...
Rudolf Mayer, Robert Neumayer, Doris Baum, Andreas...
JMIV
2010
131views more  JMIV 2010»
14 years 8 months ago
An SL(2) Invariant Shape Median
Median averaging is a powerful averaging concept on sets of vector data in finite dimensions. A generalization of the median for shapes in the plane is introduced. The underlying ...
Benjamin Berkels, Gina Linkmann, Martin Rumpf