http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Estimates of the Restricted Isometry Constant in Super Greedy Algorithms
Wei Xiujie,Ye Peixin 보안공학연구지원센터 2015 International Journal of Future Generation Communi Vol.8 No.5
Orthogonal Super Greedy Algorithm (OSGA) is a super greedy-type algorithm for sparse approximation. We analyze the convergence of OSGA based on Restricted Isometry Property (RIP). Our main conclusion is that if a matrix satisfies the Restricted Isometry Property of order [ sK ] with isometry constant δ < s / 2 s+ K , then OSGA ( s ) can exactly recover any K -sparse signal x from y = Φx in at most K iterations.