http://iet.metastore.ingenta.com
1887

Two-dimension gradient projection method for sparse matrix reconstruction

Two-dimension gradient projection method for sparse matrix reconstruction

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Electronics Letters — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Sequential order one negative exponential (SOONE) function is used to measure the sparsity of a two-dimensional (2D) signal. A 2D gradient projection (GP) method is developed to solve the SOONE function and thus the 2D-GP-SOONE algorithm is proposed. The algorithm can solve the sparse recovery of 2D signals directly. Theoretical analysis and simulation results show that the 2D-GP-SOONE algorithm has a better performance compared with the 2D smoothed L0 algorithm. Simulation results also show that the proposed algorithm has a better performance and requires less computation time than 2D iterative adaptive approach.

References

    1. 1)
    2. 2)
    3. 3)
    4. 4)
    5. 5)
    6. 6)
    7. 7)
    8. 8)
      • 8. Ghaffari, A., Babaie-Zadeh, M., Jutten, C.: ‘Sparse decomposition of two dimensional signals’. IEEE Int. Conf. Acoustics, Speech Signal Processing, Teipei, Taiwan, April 2009, pp. 31573160.
    9. 9)
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2016.0912
Loading

Related content

content/journals/10.1049/el.2016.0912
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address