빅데이터 분석을 위한 Rank-Sparsity 기반 신호처리기법 |
Lee, Hyeok
(서울대학교)
Lee, Hyeong-Il (서울대학교) Jo, Jae-Hak (서울대학교) Kim, Min-Cheol (서울대학교) So, Byeong-Hyeon (서울대학교) Lee, Jeong-U (서울대학교) |
1 | M. Wootters, Y. Plan, M.A. Davenport and E. van den Berg, "Lower bounds for quantized matrix completion," Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on. |
2 | A.Waters, A. Sankaranarayanan and R. Baraniuk, "SpaRCS: Recovering Low-Rank and Sparse Matrices from Compressive Measurements," Proceedings of the Neural Infromation Processing Systems (NIPS), 2011. |
3 | M. Grant and S. Boyd, "CVX: Matlab software for disciplined convex programming." http://stanford. edu/-boyd/cvx, 2009 |
4 | J. Cai, E. J. Candes and Z. Shen, "A Singular Value Thresholding Algorithm for Matrix Completion, SIAM, J. Optim., 20(4), 1956-1982, 2010. DOI |
5 | Z. Lin, A. Ganesh, J. Wright, L. Wu, M. Chen, and Y. Ma, "Fast convex optimization algorithms for exact recovery of a corrupted low-rank matrix," In Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP), 2009. |
6 | A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems,"SIAM Journal on Imaging Sciences, 2(1):183-202, Mar 2009. DOI |
7 | X. Yuan and J. Yang, "Sparse and low-rank matrix decomposition via alternating direction method," Pacific J. Optim., vol.9, no.1, pp 167-180, 2013. |
8 | 이형일, 이혁, 이정우, "부공간에의 사영에 기반한 RPCA 기법의 온라인 업데이트 기법", 한국통신학회 추계종합학술발표회, 2014 |
9 | E. J. Candes, X. Li, Y. Ma, and J. Wright, "Robust Principal Component Analysis?," Journal of ACM 58(1), 1-37. |
10 | V. Chandrasekaran, S. Sanghavi, P.A. Parrilo and A.S. Willsky, "Rank-Sparsity Incoherence for Matrix Decomposition," SIAM J. Optim., 21(2), 572-596, 2011. DOI |
11 | L.Breiman, "Random Forests,"Technical report, Department of Statistics, University of California, 2001. |
12 | R. Gnanadesikan and J. Kettenring, "Robust estimates, residuals, and outlier detection with multiresponse data," Biometrics, 28:81-124, 1972. DOI |
13 | J.E. Jackson. "A User's Guide to Principal Components," New York: John Wiley and Sons, 1991. |
14 | I.T.Jolliffe, "Principal Component Analysis," Springer-Verlag, 1986. |
15 | P. Huber, "Robust Statistics," Wiley and Sons, 1981 |
16 | Q. Ke and T. Kanade, "Robust l1-norm factorization in the presence of outliers and missing data,"In Proceedings of IEEE International Conference on Computer Vision and Pattern Recognition, 2005. |
17 | M. Fischler and R. Bolles, "Random sample consensus: A paradigm for model fitting with applications to image analysis and automated cartography," Communications of the ACM, 24:381-385, 1981. DOI |
18 | F. De La Torre and M. Black, "A framework for robust subspace learning," International Journal on Computer Vision, 54:117-142, 2003. DOI |
19 | H. Jiang, W. Deng, and Z. Shen, "Surveillance Video Processing Using Compressive Sensing," Inverse Problems and Imaging, Volume 6, No. 2, 201-214, 2012. DOI |
20 | Z. Zhang, A. Ganesh, X. Liang and Y. ma, "TILT: Transform Invariant Low-Rank Textures," International Journal of Computer Vision, 99(1), 1-24, 2012. DOI |
21 | A. Ganesh, K. Min, J. Wright and Y. Ma, "Principal Component Pursuit with reduced linear measurements,"Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on. |
22 | E. J. Candes and B. Recht, "Exact Matrix Completion via Convex Optimization," Foundations of Computational Mathematics, 9(6), 717-772, 2009. DOI |
23 | E. J. Candes and Y. Plan, "Matrix Completion with Noise," Proceedings of IEEE, 98(6), 925-936, 2010. DOI |
24 | R. H. Keshavan, A. Montanari and S. Oh, "Matrix Completion From a Few Entries," IEEE Transactions on Information Theory, 56(6), 2980-2998, 2010. DOI |