원문정보
보안공학연구지원센터(IJFGCN)
International Journal of Future Generation Communication and Networking
Vol.8 No.5
2015.10
pp.137-144
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
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.
목차
Abstract
1. Introduction
2. Preliminary Lemmas
3. Proof of Theorem 3
4. Conclusion
Acknowledgments
References
1. Introduction
2. Preliminary Lemmas
3. Proof of Theorem 3
4. Conclusion
Acknowledgments
References
키워드
저자정보
참고문헌
자료제공 : 네이버학술정보