Tangent-Bundle Maps on the Grassmann Manifold: Application to Empirical Arithmetic Averaging

被引:14
作者
Fiori, Simone [1 ]
Kaneko, Tetsuya [2 ]
Tanaka, Toshihisa [3 ]
机构
[1] Univ Politecn Marche, Dipartimento Ingn Informaz, I-60131 Ancona, Italy
[2] Tokyo Univ Agr & Technol TUAT, Lab Signal & Image Proc, Dept Elect & Elect Engn, Koganei, Tokyo 1848588, Japan
[3] Tokyo Univ Agr & Technol TUAT, Dept Elect & Elect Engn, Koganei, Tokyo 1848588, Japan
关键词
Riemannian geometry; committee machine; subspace analysis; Grassmann manifold; handwritten digit recognition; MEAN SHIFT; QUANTIZATION; ALGORITHMS; DISTANCE;
D O I
10.1109/TSP.2014.2365764
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The present paper elaborates on tangent-bundle maps on the Grassmann manifold, with application to subspace arithmetic averaging. In particular, the present contribution elaborates on the work about retraction/lifting maps devised for the Stiefel manifold in the recently published paper T. Kaneko, S. Fiori and T. Tanaka, "Empirical arithmetic averaging over the compact Stiefel manifold," IEEE Trans. Signal Process., Vol. 61, No. 4, pp. 883-894, February 2013, and discusses the extension of such maps to the Grassmann manifold. Tangent-bundle maps are devised on the basis of the thin QR matrix decomposition, the polar matrix decomposition and the exponential map. Also, tangent-bundle pseudo-maps based on the matrix Cayley transform are devised. Theoretical and numerical comparisons about the devised tangent-bundle maps are performed in order to get an insight into their relative merits and demerits, with special emphasis to their computational burden. The averaging algorithm based on the thin-QR decomposition maps stands out as it exhibits the best trade off between numerical precision and computational burden. Such algorithm is further compared with two Grassmann averaging algorithms drawn from the scientific literature on an handwritten digits recognition data set. The thin-QR tangent-bundle maps-based algorithm exhibits again numerical features that make it preferable over such algorithms.
引用
收藏
页码:155 / 168
页数:14
相关论文
共 41 条
[1]  
[Anonymous], 1997, NUMERICAL LINEAR ALG
[2]  
[Anonymous], 2012, Adv Neural Inf Process Syst.
[3]  
[Anonymous], 2000, Matrix analysis and applied linear algebra
[4]  
Balzano L., 2010, 2010 48th Annual Allerton Conference on Communication, Control, and Computing (Allerton), P704, DOI 10.1109/ALLERTON.2010.5706976
[5]  
Begelfor E., 2006, P IEEE COMP SOC C CO, V2, P2087, DOI [DOI 10.1109/CVPR.2006.50, 10.1109/CVPR.2006.50]
[6]   Minimum Mean Square Distance Estimation of a Subspace [J].
Besson, Olivier ;
Dobigeon, Nicolas ;
Tourneret, Jean-Yves .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2011, 59 (12) :5709-5720
[7]  
Çetingül HE, 2009, PROC CVPR IEEE, P1896, DOI 10.1109/CVPRW.2009.5206806
[8]   Quantization bounds on Grassmann manifolds and applications to MIMO communications [J].
Dai, Wei ;
Liu, Youjian Eugene ;
Rider, Brian .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (03) :1108-1123
[9]   Clustering on Multi-Layer Graphs via Subspace Analysis on Grassmann Manifolds [J].
Dong, Xiaowen ;
Frossard, Pascal ;
Vandergheynst, Pierre ;
Nefedov, Nikolai .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2014, 62 (04) :905-918
[10]   The geometry of algorithms with orthogonality constraints [J].
Edelman, A ;
Arias, TA ;
Smith, ST .
SIAM JOURNAL ON MATRIX ANALYSIS AND APPLICATIONS, 1998, 20 (02) :303-353