We consider the problem of both fast acquisition and efficient image reconstruction from partial Fourier data due to the missing or compressed information. We investigate the possibility of using different chaotic sequences to construct measurement matrices in Fourier data. In particular, we consider sequences generated by Chen chaotic system. We investigate the accuracy of reconstruction based on our proposed accelerated Dykstra-like proximal algorithm when to use different chaotic systems to construct measurement matrices of sparse or nearly sparse signals in frequency domain. We compare the recovery rate of the different chaotic sequences with Gaussian random sequences. We also investigate the recovery rate on the initial values of the chaotic systems. In practice, the relationship between the structurally sampling matrices controlled by the initial values of the chaotic systems and the structure of the sparse signal is a promising problem to enhance the recovery rate and to perform fast and efficient compressed sensing. The performance of the proposed Chen chaotic compressed sensing is analyzed by using numerical simulation with radio interferometric image and magnetic resonance image.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.