Robust Iterative Fitting of Multilinear Models

IEEE Transactions on Signal Processing

Volumn 53, Issue 8, 2005, Pages 2678-2689

  Vorobyov, Sergiy A ^a   Rong, Yue ^a   Sidiropoulos, Nicholas D ^b,c   Gershman, Alex B ^a,d  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

^b TECHNICAL UNIVERSITY OF CRETE   (Greece)

^c University of Minnesota   (United States)

^d MCMASTER UNIVERSITY   (Canada)

Author keywords

Array signal processing; non Gaussian noise; parallel factor analysis; robust model fitting

Indexed keywords

EID: 85008006603     PISSN: 1053587X     EISSN: 19410476     Source Type: Journal    
DOI: 10.1109/TSP.2005.850343     Document Type: Article

References (29)

1. R. A. Harshman, “Foundations of PARAFAC procedure: Models and conditions for an ‘explanatory’ multi-mode factor analysis,” UCLA Working Papers in Phonetics, vol. 16, pp. 1–84, 1970.
2. R. A. Harshman, “Determination and proof of minimum uniqueness conditions for PARAFAC1,” UCLA Working Papers in Phonetics, vol. 22, pp. 111–117, 1972.
3. R. A. Harshman and M. E. Lundy, “The PARAFAC model for three-way factor analysis and multidimensional scaling,” in Research Methods for Multimode Data Analysis, H. G. Law, C. W. Snyder, Jr., J. Hattie, and R. P. McDonald, Eds. New York: Praeger, 1984, pp. 122–215.
4. J. D. Carroll and J. Chang, “Analysis of individual differences in mul-tidimensional scaling via an N-way generalization of “Eckart-Young” decomposition,” Psychometr., vol. 35, no. 3, pp. 283–319, 1970.
5. J. B. Kruskal, “Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics,” Linear Algebra Appl., vol. 18, pp. 95–138, 1977.
6. N. D. Sidiropoulos, G. B. Giannakis, and R. Bro, “Blind PARAFAC receivers for DS-CDMA systems,” IEEE Trans. Signal Process., vol. 48, no. 3, pp. 810–823, Mar. 2000.
7. N. D. Sidiropoulos, R. Bro, and G. B. Giannakis, “Parallel factor analysis in sensor array processing,” IEEE Trans. Signal Process., vol. 48, no. 8, pp. 2377–2388, Aug. 2000.
8. P. Comon, “Tensor decompositions,” in Mathematics in Signal Processing V, J. G. McWhirter and I. K. Proudler, Eds. Oxford, U.K.: Clarendon, 2002, pp. 1–24.
9. n) approximation and applications of higher-order tensors,” SIAM J. Matrix Anal. Appl., vol. 21, no. 4, pp. 1324–1342, 2000.
10. L. De Lathauwer, B. De Moor, and J. Vandewalle, “Independent component analysis and (simultaneous) third-order tensor diagonalization,” IEEE Trans. Signal Process., vol. 49, no. 10, pp. 2262–2271, Oct. 2001.
11. E. Kofidis and P. A. Regalia, “On the best rank-1 approximation of higher-order super-symmetric tensors,” SIAM J. Matrix Anal. Appl., vol. 23, no. 3, pp. 863–884, 2002.
12. R. Bro, N. D. Sidiropoulos, and G. B. Giannakis, “A fast least squares algorithm for separating trilinear mixtures,” presented at the Int. Workshop Independent Component Analysis and Blind Signal Separation, Paris, France, Jan. 1999, http://www.ece.umn.edu/users/nikos/public_html/3SPICE/code.html.
13. P. Tsakalides and C. L. Nikias, “Maximum likelihood localization of sources in noise modeled as a stable process,” IEEE Trans. Signal Process., vol. 43, no. 11, pp. 2700–2713, Nov. 1995.
14. P. Tsakalides, “Array signal processing with alpha-stable distributions,” Ph.D. dissertation, Univ. Southern California, Los Angeles, Dec. 1995.
15. P. J. Huber, Robust Statistics. New York: Wiley, 1981.
16. N,” IEEE Trans. Signal Process., vol. 47, no. 3, pp. 771–782, Mar. 1999.
17. R. J. Kozick and B. M. Sadler, “Maximum-Likelihood array processing in non-Gaussian noise with Gaussian mixtures,” IEEE Trans. Signal Process., vol. 48, no. 12, pp. 3520–3535, Dec. 2000.
18. R. S. Blum, R. J. Kozick, and B. M. Sadler, “An adaptive spatial diversity receiver for non-Gaussian interference and noise,” IEEE Trans. Signal Process., vol. 47, no. 8, pp. 2100–2111, Aug. 1999.
19. R. Yang, L. Yin, M. Gabbouj, J. Astola, and Y. Neuvo, “Optimal weighted median filtering under structural constraints,” IEEE Trans. Signal Process., vol. 43, no. 3, pp. 591–603, Mar. 1995.
20. N. Karmarkar, “A new polynomial-time algorithm for linear programming,” Combinatorica, no. 4, pp. 373–395, 1984.
21. Y. Nesterov and A. Nemirovski, Interior Point Polynomial Algorithms in Convex Programming. Philadelphia, PA: SIAM, 1994.
22. X. Liu and N. D. Sidiropoulos, “Cramér-Rao lower bounds for low-rank decomposition of multidimantional arrays,” IEEE Trans. Signal Process., vol. 49, no. 9, pp. 2074–2086, Sep. 2001.
23. X. Wang and H. V. Poor, “Space-time multiuser detection in multipath CDMA channels,” IEEE Trans. Signal Process., vol. 47, no. 9, pp. 2356–2374, Sep. 1999.
24. S. N. Batalama, M. J. Medley, and I. N. Psaromiligkos, “Adaptive robust spread-spectrum receivers,” IEEE Trans. Commun., vol. 47, no. 6, pp. 905–917, Jun. 1999.
25. The MOSEK Optimization Tools Version 2.0 (Build 19). User's Manual and Reference (2001). [Online]. Available: http://www.mosek.com
26. J. G. Gonzalez, “Robust techniques for wireless communications in non-Gaussian environments,” Ph.D. dissertation, Univ. Delaware, Newark, 1997.
27. S. M. Kay, Fundamentals of Statistical Signal Processing: Detection Theory. Upper Saddle River, NJ: Prentice-Hall, 1998.
28. A. Swami, “Cramér-Rao bounds for deterministic signals in additive and multiplicative noise,” Signal Process., vol. 53, no. 2–3, pp. 231–244, Sep. 1996.
29. A. Swami and B. M. Sadler, “On some detection and estimation problems in heavy-tailed noise,” Signal Process., vol. 82, no. 12, pp. 1829–1846, Dec. 2002.