LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Bicomplex signals with sparsity constraints

Photo from academic.microsoft.com

In this paper we aim to proof the possibility to reconstruct a bicomplex sparse signal, with high probability, from a reduced number of bicomplex random samples. Due to the idempotent… Click to show full abstract

In this paper we aim to proof the possibility to reconstruct a bicomplex sparse signal, with high probability, from a reduced number of bicomplex random samples. Due to the idempotent representation of the bicomplex algebra this case is similar to the case of the standard Fourier basis, thus allowing us to adapt in a rather easy way the arguments from the recent works of Rauhut and Candés et al..

Keywords: sparsity constraints; bicomplex signals; signals sparsity

Journal Title: Mathematical Methods in The Applied Sciences
Year Published: 2018

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.