Spherical embeddings for non-euclidean dissimilarities

Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Volumn , Issue , 2010, Pages 1903-1910

  Wilson, Richard C ^a   Hancock, Edwin R ^a   Pȩkalska, Elzbieta ^b   Duin, Robert P W ^c  

^a UNIVERSITY OF YORK   (United Kingdom)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

^c Department of Microelectronics   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT METHOD; EMBEDDING PROBLEMS; EMBEDDINGS; EUCLIDEAN; HYPERSPHERICAL; LOCAL STRUCTURE; METRIC SPACES; NEGATIVE CURVATURE; NON-EUCLIDEAN; PATTERN RECOGNITION PROBLEMS; RADIUS OF CURVATURE;

COMPUTER VISION; TOPOLOGY;

COMPUTATIONAL METHODS;

EID: 77956007665     PISSN: 10636919     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2010.5539863     Document Type: Conference Paper

References (14)

1. G. Andreu, A. Crespo, and J. Valiente. Selecting the toroidal self-organizing feature maps (tsofm) best organized to object recognition. In ICNN'97, pages 1341-1346, 1997.
2. P. T. Fletcher, C. Lu, S. M. Pizer, and S. Joshi. Principal geodesic analysis for the study of nonlinear statistics of shape. IEEE Transactions on Medical Imaging, 23(8):995-1005, 2004.
3. S. Gold and A. Rangarajan. A graduated assignment algorithm for graph matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, 18:377-388, 1996.
4. L. Goldfarb. A unified approach to pattern recognition. Pattern Recognition, 17:575-582, 1984.
5. L. Hubert, P. Arabie, and J. Meulman. Linear and circular unidimensional scaling for symmetric proximity matrices. British Journal of Mathematical & Statistical Psychology, 50:253-284, 1997.
6. J. Lichtenauer, E. A. Hendriks, and M. J. T. Reinders. Sign language recognition by combining statistical dtw and independent classfication. IEEE Transactions on Pattern Analysis and Machine Intelligence, 30:2040-2046, 2008.
7. H. Lindman and T. Caelli. Constant curvature riemannian scaling. Journal of Mathematical Psychology, 17:89-109, 1978.
8. E. Pekalska and R. P. W. Duin. The dissimilarity representation for pattern recognition. World Scientific, 2005.
9. E. Pekalska, A. Harol, R. P. W. Duin, B. Spillmann, and H. Bunke. Non-euclidean or non-metric measures can be informative. In SSPR/SPR, pages 871-880, 2006.
10. A. Robles-Kelly and E. R. Hancock. A riemannian approach to graph embedding. Pattern Recognition, 40:1042-1056, 2007.
11. I. Schoenberg. On certain metric spaces arising from euclidean spaces by a change of metric and their imbedding in hilbert space. Annals of Mathematics, 38:787-797, 1937.
12. Y. Shavitt and T. Tankel. Hyperbolic embedding of internet graph for distance estimation and overlay construction. IEEE/ACM Transactions on Networking, 16:25-36, 2008.
13. J. B. Tenenbaum, V. de Silva, and J. C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290:2319-2323, 2000.
14. B. Xiao and E. R. Hancock. Geometric characterisation of graphs. ICIAP 2005, LNCS 3617:471-478, 2005.