Compute Karcher means on SO(n) by the geometric conjugate gradient method

Neurocomputing

Volumn 215, Issue , 2016, Pages 169-174

  Ying, Shihui ^a   Qin, Han ^a   Peng, Yaxin ^a   Wen, Zhijie ^a  

^a SHANGHAI UNIVERSITY   (China)

Author keywords

Conjugate gradient method; Karcher mean; Rotation group; Structure preserving

Indexed keywords

NUMERICAL METHODS;

GEOMETRIC STRUCTURE; KARCHER MEANS; MINIMIZATION PROBLEMS; NUMERICAL EXPERIMENTS; ROTATION GROUP; STRUCTURE-PRESERVING;

CONJUGATE GRADIENT METHOD;

ALGORITHM; ARTICLE; GEOMETRY; INTERMETHOD COMPARISON; LINEAR SYSTEM; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MATHEMATICAL MODEL; MATHEMATICAL PARAMETERS; PRIORITY JOURNAL; STATISTICAL ANALYSIS; STATISTICAL PARAMETERS;

EID: 84992520717     PISSN: 09252312     EISSN: 18728286     Source Type: Journal    
DOI: 10.1016/j.neucom.2015.05.143     Document Type: Article

References (31)

1. [1] Absil, P., Mahony, R., Sepulchre, R., Optimization Algorithms on Matrix Manifolds. 2008, Princeton University Press, New Jersey.
2. [2] N. Boumal, P. Absil, A discrete regression method on manifolds and its application to data on SO(n), in: 18th IFAC World Congress, Milano, Italy, 2011.
3. [3] Boyd, S., Vandenberghe, L., Convex Optimization. 2004, Cambridge University Press, Cambridge, UK.
4. [4] Dai, Y., Yuan, Y., A nonlinear conjugate gradient method with a strong global convergence property. SIAM J. Optim. 10 (1999), 177–182.
5. [5] Du, S., Zheng, N., Ying, S., Liu, J., Affine iterative closest point algorithm for point set registration. Pattern Recog. Lett. 31:9 (2010), 791–799.
6. [6] Du, S., Liu, J., Zhang, C., Zhu, J., Li, K., Probability iterative closest point algorithm for m-D point set registration with noise. Neurocomputing, 2016 In press.
7. [7] Du, S., Zheng, N., Xiong, L., Ying, S., Xue, J., Scaling iterative closest point algorithm for registration of m-d point sets. J. Vis. Commun. Image Represent. 21:5–6 (2010), 442–452.
8. [8] Edelman, A., Arias, T., Smith, S., The geometry of algorithms with orthogonality constraints. SIAM J. Matrix Anal. Appl. 20 (1998), 303–353.
9. [9] S. Fiori, A closed-form solution to the problem of averaging over the Lie group of special orthogonal matrices, in: Lecture Notes on Computer Science, vol. 6063, 2010, pp. 185-192.
10. [10] Fiori, S., Tanaka, T., An algorithm to compute averages on matrix Lie groups. IEEE Trans. Signal Process. 57 (2009), 4734–4743.
11. [11] Fletcher, R., Reeves, C., Function minimization by conjugate gradients. Comput. J. 7 (1964), 149–154.
12. [12] Gao, Y., Wang, M., Tao, D., Ji, R., Dai, Q., 3D object retrieval and recognition with hypergraph analysis. IEEE Trans. Image Process. 21:9 (2012), 4290–4303.
13. [13] Gao, Y., Wang, M., Zha, Z., Shen, J., Li, X., Wu, X., Visual-textual joint relevance learning for tag-based social image search. IEEE Trans. Image Process. 22:1 (2013), 363–376.
14. [14] Gao, Y., Ji, R., Cui, P., Dai, Q., Hua, G., Hyperspectral image classification through bilayer graph based learning. IEEE Trans. Image Process. 23:7 (2014), 2769–2778.
15. 1-close group actions. Math. Z. 132:1 (1973), 11–20.
16. [16] Hager, W., Zhang, H., A survey of nonlinear conjugate gradient methods. Pacific J. Optim. 2 (2006), 35–58.
17. [17] Helgason, S., Differential Geometry, Lie Groups and Symmetric Space. 2001, Academic Press, Providence, Rhode Island.
18. [18] Hestenes, M., Stiefel, E., Methods of conjugate gradients for solving linear systems. J. Res. Natl. Bur. Stand. 49 (1952), 409–436.
19. [19] Jost, J., Riemannian Geometry and Geometric Analysis. 2002, Springer-Verlag, New York.
20. [20] Kacher, H., Riemannian center of mass and mollifier smoothing. Commun. Pure Appl. Math. 30 (1977), 509–541.
21. [21] Lawson, J., Lim, Y., Karcher means and Karcher equations of positive definite operators. Trans. AMS 1 (2014), 1–22.
22. [22] Li, R., Turaga, P., Srivastava, A., Chellappa, R., Differential geometric representations and algorithms for some pattern recognition and computer vision problems. Pattern Recognit. Lett. 43 (2014), 3–11.
23. [23] Manning, R., Bulman, G., Stability of an elastic rod buckling into a soft wall. Proc. R. Soc. A 461 (2005), 2423–2450.
24. [24] Manton, J., Optimization algorithms exploiting unitary constraints. IEEE Trans. Signal Process. 50 (2002), 635–649.
25. [25] Manton, J., A center (Karcher mean) approach to the joint approximate diagonalisation problem: the real symmetric case. Digit. Signal Process. 16 (2006), 468–478.
26. [26] Moakher, M., Means and averaging in the group of rotations. SIAM J. Matrix Anal. Appl. 24 (2002), 1–16.
27. [27] Peng, L., Sun, H., Sun, D., Yi, J., The geometric structures and instability of entropic dynamical models. Adv. Math. 227 (2011), 459–471.
28. [28] Plumbley, B., Geometrical methods for non-negative ICA: manifolds, Lie groups and toral subalgebras. Neurocomputing 67 (2005), 161–197.
29. [29] Polak, E., Ribière, G., Note sur la convergence de directions conjugées. Rev. Fr. Informat. Rech. Oper. 16 (1969), 35–43.
30. [30] Polyak, B., The conjugate gradient method in extreme problems. USSR Comp. Math. Math. Phys. 9 (1969), 94–112.
31. [31] S. Smith, Geometric optimization methods for adaptive filtering (Ph.D. thesis), Division of Applied Science, Harvard University, Cambridge, 1993.