다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
電子工學會論文誌. Journal of the Institute of Electronics Engineers of Korea. SP, 신호처리, v.46 no.5 = no.329, 2009년, pp.15 - 24
이기륭 (일리노이 주립대학교) , 예종철 (한국과학기술원 바이오및뇌공학과)
AI-Helper
Compressed sensing addresses the recovery of a sparse vector from its few linear measurements. Recently, the success for the vector case has been extended to the matrix case. Compressed sensing of low-rank matrices solves the ill-posed inverse problem with fie low-rank prior. The problem can be form...
* AI 자동 식별 결과로 적합하지 않은 문장이 있을 수 있으니, 이용에 유의하시기 바랍니다.
M. Fazel, 'Matrix rank minimization with applications,' Ph.D. dissertation, Stanford University, 2002
B. Recht, M. Fazel, and P. Parrilo, 'Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization,' Arxiv preprint arXiv:0706.4138, 2007
E. Candes and B. Recht, 'Exact Matrix Completion via Convex Optimization,' Arxiv preprint arXiv:0805.4471, 2008
M. Fazel, H. Hindi, and S. Boyd, 'A rank minimization heuristic with application to minimum order system approximation,' in Proceedings American Control Conference, vol. 6, 2001, pp. 4734？4739
G. Watson, 'On matrix approximation problems with Ky Fank norms,' Numerical Algorithms, vol. 5, no. 5, pp. 263？272, 1993
J. Cai, E. Candes, and Z. Shen, "A singular value thresholding algorithm for matrix completion," Arxiv preprint arXiv:0810.3286, 2008
K. Lee and Y. Bresler, 'Efficient and guaranteed rank minimization by atomic decomposition,' Arxiv preprint arXiv:0901.1898, 2009
S. Mallat and Z. Zhang, 'Matching pursuits with time-frequency dictionaries,' IEEE Transactions on Signal Processing, vol. 41, no. 12, pp. 3397？3415, 1993
Y. Pati, R. Rezaiifar, and P. Krishnaprasad, 'Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition,' in Proc. Asilomar Conf. on Signals, Systems, and Computers, vol. 1, Pacific Grove, CA, Nov. 1993, pp. 40？44
D. Needell and J. Tropp, 'CoSaMP: Iterative signal recovery from incomplete and inaccurate samples,' Arxiv preprint arXiv:0803.2392, 2008
W. Dai and O. Milenkovic, 'Subspace pursuit for compressive sensing: closing the gap between performance and complexity,' Arxiv preprint arXiv:0803.0811, 2008
K. Lee and Y. Bresler, 'ADMiRA: Atomic Decomposition for Minimum Rank Approximation,' Arxiv preprint arXiv:0905.0044, 2009
J. Haldar and D. Hernando, 'Rank-Constrained Solutions to Linear Matrix Equations using PowerFactorization,' will appear in IEEE Signal Processing Letters
R. Keshavan, S. Oh, and A. Montanari, 'Matrix Completion from a Few Entries,' Arxiv preprint arXiv:0901.3150, 2009
A. Edelman, T. Arias, and S. Smith, 'The Geometry of Algorithms with Orthogonality Constraints,' SIAM journal on matrix analysis and applications, vol. 20, no. 2, pp. 303？353, 1999
M. Fazel, E. Candes, B. Recht, and P. Parrilo, 'Compressed sensing and robust recovery of low rank matrices,' in Proc. Asilomar Conf. on Signals, Systems, and Computers, Pacific Grove, CA, Oct. 2008
R. Larsen, 'PROPACK？Software for large and sparse SVD calculations,' Available from http://soi.stanford.edu/ rmunk/PROPACK/
S. Har-Peled, 'Low rank matrix approximation in linear time,' note, 2006
L. Mirsky, 'Symmetric gauge functions and unitarily invariant norms,' The Quarterly Journal of Mathematics, vol. 11, no. 1, pp. 50-59, 1960
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.