Mixtures of probabilistic principal component analyzers
Neural Computation
Simplified representation of vector fields
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
A continuous clustering method for vector fields
Proceedings of the conference on Visualization '00
A topology simplification method for 2D vector fields
Proceedings of the conference on Visualization '00
Segmentation of Discrete Vector Fields
IEEE Transactions on Visualization and Computer Graphics
Manifold learning of vector fields
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
Supervised learning for classification
FSKD'05 Proceedings of the Second international conference on Fuzzy Systems and Knowledge Discovery - Volume Part II
Go with the flow: the direction-based fréchet distance of polygonal curves
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Manifold learning of vector fields
ISNN'06 Proceedings of the Third international conference on Advances in Neural Networks - Volume Part I
Hi-index | 0.00 |
Vector data containing direction and magnitude information other than position information is different from common point data only containing position information. Those general similarity measures for point data such as Euclidean distance are not suitable for vector data. Thus, a novel measure must be proposed to estimate the similarity between vectors. The similarity measure defined in this paper combines Euclidean distance with angle and magnitude differences. Based on this measure, we construct a vector field space on which a modified locally linear embedding (LLE) algorithm is used for vector field learning. Our experimental results show that the proposed similarity measure works better than traditional Euclidean distance.