On vector averaging over the unit hypersphere

Digital Signal Processing: A Review Journal

Volumn 19, Issue 4, 2009, Pages 715-725

  Fiori, Simone ^a  

^a UNIVERSITÀ POLITECNICA DELLE MARCHE   (Italy)

Author keywords

Divergence; Mean value computation on curved spaces; Optimization on manifolds; Unit hypersphere

Indexed keywords

ADAPTIVE SYSTEMS;

ADAPTIVE SIGNAL PROCESSING; DIVERGENCE; GEOMETRICAL STRUCTURE; HYPERSPHERE; MEAN VALUES; NUMERICAL EXPERIMENTS; OPTIMIZATION ON MANIFOLDS; REPRESENTATIVE PATTERNS;

SIGNAL PROCESSING;

EID: 67349130556     PISSN: 10512004     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dsp.2008.07.005     Document Type: Article

References (20)

1. Banerjee A., Merugu S., Dhillon I., and Ghosh J. Clustering with Bregman divergences. J. Mach. Learn. Res. 6 (2005) 1705-1749
2. Bernoulli J. Ars conjectandi: Usum & applicationem praecedentis (1713), Doctrinae Civilibus, Moralibus & Oeconomicis Chapter 4
3. Bregman L.M. The relaxation method of finding the common point of convex sets and its applications to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 7 3 (1967) 200-217
4. Choi S., Ong S., Cho J., You C., and Hong D. Performances of neural equalizers on partial erasure model. IEEE Trans. Magn. 33 5 (1997) 2788-2790
5. Chou Y.-L. Statistical Analysis: With Business and Economic Applications (1969), Holt, Rinehart and Winston Inc., New York
6. Del Buono N., and Lopez L. Runge-Kutta type methods based on geodesics for systems of ODEs on the Stiefel manifold. BIT-Numer. Math. 41 5 (2001) 912-923
7. Ding Z., and Li Y. Blind Equalization and Identification (2001), Marcel Dekker, New York
8. Fiori S. Neural minor component analysis approach to robust constrained beamforming. IEE Proc. Vision Image Signal Process. 150 4 (2003) 205-218
9. Fiori S. Overview of independent component analysis technique with an application to synthetic aperture radar (SAR) imagery processing. Neural Netw. (Special Issue on "Neural Networks for Analysis of Complex Scientific Data: Astronomy, Geology and Geophysics") 16 3-4 (2003) 453-467
10. Fiori S. A fast fixed-point neural blind deconvolution algorithm. IEEE Trans. Neural Netw. 15 2 (2004) 455-459
11. Fiori S. Geodesic-based and projection-based neural blind deconvolution algorithms. Signal Process. 88 3 (2008) 521-538
12. Fiori S., and Burrascano P. One-unit 'rigid-bodies' learning rule for principal/independent component analysis with application to ECT-NDE signal processing. Neurocomputing 56 (2004) 233-255
13. Fréchet M. Les élements aléatoires de nature quelconque dans un espace distancié. Ann. Inst. H. Poincaré 10 (1948) 215-310
14. Hyvärinen A. Fast and robust fixed-point algorithms for independent component analysis. IEEE Trans. Neural Netw. 10 3 (1999) 626-634
15. Koenker R. The median is the message: Toward the Fréchet median. J. Soc. Fr. Stat. 147 2 (2006) 61-64
16. F. Nielsen, J.-D. Boissonnat, R. Nock, Bregman Voronoi diagrams: Properties, algorithms and applications, Institut National de Recherche en Informatique et en Automatique (INRIA Sophia Antipolis), Research Report No. 6154, 2007
17. P. Pajunen, M. Girolami, Implementing decisions in binary decision trees using independent component analysis, in: Proceedings of the International Workshop on Independent Component Analysis and Blind Signal Separation, Helsinki, Finland, June 19-22, 2000, pp. 477-481
18. Shalvi O., and Weinstein E. Super-exponential methods for blind deconvolution. IEEE Trans. Inform. Theory 39 (1993) 504-519
19. Sundaram R.K. Existence of solutions: The Weierstrass Theorem. A First Course in Optimization Theory (1996), Cambridge University Press Chapter 3
20. Wiggins R.A. Minimum entropy deconvolution. Geoexploration 16 (1978) 21-35