Multi-way compressed sensing for sparse low-rank tensors

IEEE Signal Processing Letters

Volumn 19, Issue 11, 2012, Pages 757-760

  Sidiropoulos, Nicholas D ^a   Kyrillidis, Anastasios ^b  

^a University of Minnesota   (United States)

^b EPFL   (Switzerland)

Author keywords

CANDECOMP PARAFAC; compressed sensing; multi way analysis; tensor decomposition

Indexed keywords

BILINEAR MODELS; CANDECOMP; COMPRESSED DOMAIN; COMPRESSIVE SENSING; DATA SETS; LOADING VECTOR; MEMORY CAPACITY; MULTI-WAY ANALYSIS; NONZERO ENTRIES; OUTER PRODUCT; RECOVERY PROCESS; SIGNAL OF INTERESTS; SPARSE SIGNALS; SPECIAL CLASS; TENSOR DECOMPOSITION; THEORY AND METHODS; TWO-STEP PROCESS;

SIGNAL RECONSTRUCTION;

TENSORS;

EID: 84866665200     PISSN: 10709908     EISSN: None     Source Type: Journal    
DOI: 10.1109/LSP.2012.2210872     Document Type: Article

References (27)

1. D. Donoho and M. Elad, "Optimally sparse representation in general (nonorthogonal) dictionaries via minimization," Proc. Nat. Acad. Sci., vol. 100, no. 5, pp. 2197-2202, 2003. (Pubitemid 36297476)
2. E. Candès, J. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements," Commun. Pure Appl. Math., vol. 59, no. 8, pp. 1207-1223, 2006. (Pubitemid 43988295)
3. E. Candès and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., vol. 9, no. 6, pp. 717-772, 2009.
4. E. Candès and T. Tao, "The power of convex relaxation: Near-optimal matrix completion," IEEE Trans. Inf. Theory, vol. 56, no. 5, pp. 2053-2080, 2010.
5. J. Carroll and J. Chang, "Analysis of individual differences in multidimensional scaling via an n-way generalization of Eckart-Young decomposition," Psychometrika, vol. 35, no. 3, pp. 283-319, 1970.
6. R. Harshman, "Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multimodal factor analysis," UCLA Working Papers in Phonetics, vol. 16, pp. 1-84, 1970.
7. R. Harshman, "Determination and proof of minimum uniqueness conditions for PARAFAC-1," UCLAWorking Papers in Phonetics, vol. 22, pp. 111-117, 1972.
8. J. Kruskal, "Three-way arrays: Rank and uniqueness of trilinear decompositions, with application to arithmetic complexity and statistics," Lin. Alg. Applicat., vol. 18, no. 2, pp. 95-138, 1977.
9. A. Smilde, R. Bro, P. Geladi, and J. Wiley, Multi-Way Analysis With Applications in the Chemical Sciences. Hoboken, NJ: Wiley, 2004.
10. E. Papalexakis and N. Sidiropoulos, "Co-clustering as multilinear decomposition with sparse latent factors," in IEEE ICASSP 2011, Prague, Czech Republic, May 22-27, 2011, pp. 2064-2067.
11. L.-H. Lim and P. Comon, "Multiarray signal processing: Tensor decomposition meets compressed sensing," Comptes Rendus Mécanique, vol. 338, no. 6, pp. 311-320, 2010.
12. L. De Lathauwer, B. De Moor, and J. Vandewalle, "A multilinear singular value decomposition," SIAM J. Matrix Anal. Appl., vol. 21, no. 4, pp. 1253-1278, 2000. (Pubitemid 33217068)
13. N. Sidiropoulos and R. Bro, "On the uniqueness of multilinear decomposition of N-way arrays," J. Chemometrics, vol. 14, no. 3, pp. 229-239, 2000.
14. T. Jiang and N. Sidiropoulos, "Kruskal's permutation lemma and the identification of CANDECOMP/PARAFAC and bilinear models with constant modulus constraints," IEEE Trans. Signal Process., vol. 52, no. 9, pp. 2625-2636, 2004.
15. A. Stegeman and N. Sidiropoulos, "On Kruskal's uniqueness condition for the CANDECOMP/PARAFAC decomposition," Lin. Alg. Applicat., vol. 420, no. 2-3, pp. 540-552, 2007. (Pubitemid 44751783)
16. R. Bro and C. Anderson, "Improving the speed of multiway algorithms Part II: Compression," Chemometr. Intel. Lab. Syst., vol. 42, pp. 105-113, 1998. (Pubitemid 28440365)
17. J. Carroll, S. Pruzansky, and J. Kruskal, "CANDELINC: A general approach to multidimensional analysis of many-way arrays with linear constraints on parameters," Psychometrika, vol. 45, no. 1, pp. 3-24, 1980.
18. R. Bro, N. Sidiropoulos, and G. Giannakis, "A fast least squares algorithm for separating trilinear mixtures," in Proc. ICA99 Int. Workshop on Independent Component Analysis and Blind Signal Separation, 1999, pp. 289-294 [Online]. Available: http://www.ece.umn.edu/~nikos/comfac.m
19. B. Bader and T. Kolda, "Efficient MATLAB computations with sparse and factored tensors," SIAM J. Sci. Comput., vol. 30, no. 1, pp. 205-231, 2007.
20. T. Kolda and J. Sun, "Scalable tensor decompositions for multi-aspect data mining," in ICDM 2008: Proc. 8th IEEE Int. Conf. Data Mining, pp. 363-372.
21. J. Brewer, "Kronecker products and matrix calculus in system theory," IEEE Trans. Circuits Syst., vol. CAS-25, no. 9, pp. 772-781, 1978. (Pubitemid 9394325)
22. T. Jiang, N. Sidiropoulos, and J. ten Berge, "Almost sure identifiability of multidimensional harmonic retrieval," IEEE Trans. Signal Process., vol. 49, no. 9, pp. 1849-1859, 2001. (Pubitemid 32866194)
23. C. Hillar and L.-H. Lim,Most Tensor Problems are NP-Hard 2009 [Online]. Available: http://arxiv.org/abs/0911.1393
24. E. Candès and J. Romberg, -Magic: Recovery of Sparse Signals via Convex Programming 2005 [Online]. Available: http://www-stat.stanford. edu/~candes/l1magic/downloads/l1magic.pdf
25. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
26. A. Stegeman, J. ten Berge, and L. De Lathauwer, "Sufficient conditions for uniqueness in CANDECOMP/PARAFAC and INDSCAL with random component matrices," Psychometrika, vol. 71, no. 2, pp. 219-229, 2006. (Pubitemid 44116380)
27. R. Tomioka, T. Suzuki, K. Hayashi, and H. Kashima, "Statistical performance of convex tensor decomposition," in Advances in Neural Information Processing Systems 24, J. Shawe-Taylor, R. S. Zemel, P. Bartlett, F. C. N. Pereira, and K. Q. Weinberger, Eds., 2011, pp. 972-980.