Robust statistics on Riemannian manifolds via the geometric median

26th IEEE Conference on Computer Vision and Pattern Recognition, CVPR

Volumn , Issue , 2008, Pages

  Fletcher, P Thomas ^a   Venkatasubramanian, Suresh ^a   Joshi, Sarang ^b  

^a Department of Electrical and Computer Engineering

^b UNIVERSITY OF UTAH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CENTRAL POINT; DATA POINTS; EUCLIDEAN; EUCLIDEAN SPACES; EXISTENCE AND UNIQUENESS; GEODESIC DISTANCES; MEDIAN COMPUTATION; RIEMANNIAN MANIFOLDS; ROBUST ESTIMATORS; ROBUST STATISTICS; SHAPE SPACES; SUFFICIENT CONDITIONS; UNIQUE SOLUTION; VISION APPLICATIONS;

ARTIFICIAL INTELLIGENCE; COMPUTER VISION; FEATURE EXTRACTION; IMAGE PROCESSING; PATTERN RECOGNITION; THREE DIMENSIONAL;

COMPUTATIONAL GEOMETRY;

EID: 51949100053     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CVPR.2008.4587747     Document Type: Conference Paper

References (35)

1. C. Bajaj. The algebraic degree of geometric optimization problems. Discrete and Computational Geometry, 3:177-191, 1988.
2. P. J. Basser, J. Mattiello, and D. L. Bihan. MR diffusion tensor spectroscopy and imaging. Biophysics Journal, 66:259-267, 1994.
3. P. Batchelor, M. Moakher, D. Atkinson, F. Calamante, and A. Connelly. A rigorous framework for diffusion tensor calculus. Magnetic Resonance in Medicine, 53:221-225, 2005.
4. J. Bigun, G. Granlund, and J. Wiklund. Multidimensional orientation estimation with application to texture analysis and optical flow. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13(8):775-790, 1991.
5. F. L. Bookstein. Size and shape spaces for landmark data in two dimensions (with discussion). Statistical Science, 1(2):181-242, 1986.
6. P. Bose, A. Maheshwari, and P. Morin. Fast approximations for sums of distances, clustering and the fermat-weber problem. Comput. Geom. Theory Appl., 24(3):135-146, 2003.
7. S. R. Buss and J. P. Fillmore. Spherical averages and applications to spherical splines and interpolation. ACM Transactions on Graphics, 20(2):95-126, 2001.
8. R. Chandrasekaran and A. Tamir. Algebraic optimization: The Fermat-Weber problem. Mathematical Programming, 46:219-224, 1990.
9. J. Cheeger and D. G. Ebin. Comparison Theorems in Riemannian Geometry. North-Holland, 1975.
10. T. F. Cootes, C. J. Taylor, D. H. Cooper, and J. Graham. Active shape models - their training and application. Comp. Vision and Image Understanding, 61(1):38-59, 1995.
11. U. Eckhardt. Weber's problem and Weiszfeld's algorithm in general spaces. Mathematical Programming, 18:186-196, 1980.
12. M. A. Fischler and R. C. Bolles. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Communications of the ACM, 24(6):381-395, 1981.
13. P. T. Fletcher and S. Joshi. Principal geodesic analysis on symmetric spaces: statistics of diffusion tensors. In Proceedings of ECCV Workshop on Computer Vision Approaches to Medical Image Analysis, 2004.
14. P. T. Fletcher, C. Lu, and S. Joshi. Statistics of shape via principal geodesic analysis on Lie groups. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 95-101, 2003.
15. M. Fréchet. Les éléments aléatoires de nature quelconque dans un espace distancié. Ann. Inst. H. Poincaré, 10(3):215-310, 1948.
16. U. Grenander and D. M. Keenan. On the shape of plane images. SIAM J. Appl. Math., 53:1072-1094, 1991.
17. P. J. Huber. Robust Statistics. John Wiley, New York, 1981.
18. H. Karcher. Riemannian center of mass and mollifier smoothing. Comm. on Pure and Appl. Math., 30:509-541, 1977.
19. D. G. Kendall. Shape manifolds, Procrustean metrics, and complex projective spaces. Bulletin of the London Mathematical Society, 16:18-121, 1984.
20. E. Klassen, A. Srivastava, W. Mio, and S. Joshi. Analysis of planar shapes using geodesic paths on shape spaces. IEEE Transactions on Pattern Analysis and Machine Intelligence, 26(3):372-383, 2004.
21. H. W. Kuhn. A note on Fermat's problem. Mathematical Programming, 4:98-107, 1973.
22. H. W. Kuhn and R. E. Kuenne. An efficient algorithm for the numerical solution of the generalized Weber problem in spatial economics. J. Regional Sci., 4:21-34, 1962.
23. N. Lepore, C. A. Brun, M.-C. Chiang, Y.-Y. Chou, R. A. Dutton, K. M. Hayashi, O. L. Lopez, H. J. Aizenstein, A. W. Toga, J. T. Becker, and P. Thompson. Multivariate statistics of the Jacobian matrices in tensor based morphometry and their application to HIV/AIDS. In MICCAI, pages 191-198, 2006.
24. H. P. Lopuhaa and P. J. Rousseeuw. Breakdown points of affine equivariant estimators of multivariate location and covariance matrices. The Annals of Statistics, 19(1):229-248, 1991.
25. P. Meer, D. Mintz, D. Y. Kim, and A. Rosenfeld. Robust regression methods in computer vision: a review. International Journal of Computer Vision, 6:59-70, 1991.
26. P. W. Michor and D. Mumford. Riemannian geometries on spaces of plane curves. J. Eur. Math. Soc., 8:1-48, 2006.
27. L. M. Ostresh. On the convergence of a class of iterative methods for solving the Weber location problem. Operations Research, 26:597-609, 1978.
28. X. Pennec. Intrinsic statistics on Riemannian manifolds: basic tools for geometric measurements. Journal of Mathematical Imaging and Vision, 25(1), 2006.
29. X. Pennec, P. Fillard, and N. Ayache. A Riemannian framework for tensor computing. International Journal of Computer Vision, 61(1):41-66, 2006.
30. Y. Rathi, A. Tannenbaum, and O. Michailovich. Segmenting images on the tensor manifold. In IEEE Conference on Computer Vision and Pattern Recognition, pages 1-8, 2007.
31. E. Sharon and D. Mumford. 2d-shape analysis using conformal mapping. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pages 350-357, 2004.
32. A. Srivastava, S. Joshi, W. Mio, and X. Liu. Statistical shape analysis: clustering, learning, and testing. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(4):590-602, 2005.
33. C. V. Stewart. Robust parameter estimation in computer vision. SIAM Review, 41(3):513-537, 1999.
34. E. Weiszfeld. Sur le point pour lequel la somme des distances de n points donnés est minimum. Tohoku Math. J., 43:355-386, 1937.
35. L. Younes. Computable elastic distances between shapes. SIAM J. Appl. Math., 58:565-586, 1998.