Iterative method for simultaneous sparse approximation

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Sadrizadeh s.; Kianidehkordi Sh.; Boloursaz Mashhadi m.; MARVASTI F.

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: SCIENTIA IRANICA Year:2019 | Volume:26 | Issue:3 (Transactions D: Computer Science and Engineering and Electrical Engineering) Page(s): 1601-1607

Download Full-Text

View:

294

Download:

202

Cites:

Information Journal Paper

Title

Iterative method for simultaneous sparse approximation

Author(s)

Sadrizadeh s. | Kianidehkordi Sh. | Boloursaz Mashhadi m. | MARVASTI F. | Issue Writer Certificate

Keywords

Simultaneous sparse approximation

Iterative method

Joint recovery

Abstract

This paper studies the problem of Simultaneous Sparse Approximation (SSA). This problem arises in many applications that work with multiple signals maintaining some degree of dependency, e. g., radar and sensor networks. We introduce a new method towards joint recovery of several independent sparse signals with the same support. We provide an analytical discussion of the convergence of our method, called Simultaneous Iterative Method (SIM). In this study, we compared our method with other group-sparse reconstruction techniques, namely Simultaneous Orthogonal Matching Pursuit (SOMP) and Block Iterative Method with Adaptive Thresholding (BIMAT), through numerical experiments. The simulation results demonstrated that SIM outperformed these algorithms in terms of the metrics Signal to Noise Ratio (SNR) and Success Rate (SR). Moreover, SIM is considerably less complicated than BIMAT, which makes it feasible for practical applications such as implementation in MIMO radar systems.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

APA: Copy

Sadrizadeh, s., Kianidehkordi, Sh., Boloursaz Mashhadi, m., & MARVASTI, F.. (2019). Iterative method for simultaneous sparse approximation. SCIENTIA IRANICA, 26(3 (Transactions D: Computer Science and Engineering and Electrical Engineering)), 1601-1607. SID. https://sid.ir/paper/290656/en

Vancouver: Copy

Sadrizadeh s., Kianidehkordi Sh., Boloursaz Mashhadi m., MARVASTI F.. Iterative method for simultaneous sparse approximation. SCIENTIA IRANICA[Internet]. 2019;26(3 (Transactions D: Computer Science and Engineering and Electrical Engineering)):1601-1607. Available from: https://sid.ir/paper/290656/en

IEEE: Copy

s. Sadrizadeh, Sh. Kianidehkordi, m. Boloursaz Mashhadi, and F. MARVASTI, “Iterative method for simultaneous sparse approximation,” SCIENTIA IRANICA, vol. 26, no. 3 (Transactions D: Computer Science and Engineering and Electrical Engineering), pp. 1601–1607, 2019, [Online]. Available: https://sid.ir/paper/290656/en

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans

No record.

Recommended Workshops