Secure frequency-domain image compressed sensing with matrix-inversion-free recovery

Image encryption should be performed prior to image compression in many real-world applications. This results in the requirement of compressing the encrypted image. Compressed sensing (CS) is an attractive tool for compressing encrypted images. Unfortunately, most existing CS-based image encryption-...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optik (Stuttgart) Ročník 276; s. 170677
Hlavní autoři: Huang, Hui, Xiao, Di, Li, Xinyan
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier GmbH 01.04.2023
Témata:
Accompanying access password
Bilateral permutation
Encryption-then-compression
Matrix-inversion-free orthogonal matching pursuit
Nonzero entry diffusion encryption
Nonzero entry diffusion encryption
Matrix-inversion-free orthogonal matching pursuit
Accompanying access password
Encryption-then-compression
Bilateral permutation
ISSN:0030-4026, 1618-1336
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Image encryption should be performed prior to image compression in many real-world applications. This results in the requirement of compressing the encrypted image. Compressed sensing (CS) is an attractive tool for compressing encrypted images. Unfortunately, most existing CS-based image encryption-then-compression (ETC) schemes face several critical challenges, such as low security, high-complexity sampling and recovery. Therefore, this paper presents a secure frequency-domain image CS scheme with matrix-inversion-free (MIF) recovery for ETC applications to address the above challenges. More specifically, the bilateral permutation and nonzero entry diffusion encryption operations are utilized to encrypt the frequency-domain image orderly. Surprisingly, the above two encryption operations do not compromise recovery performance with proper parameters. Then, the encrypted frequency-domain image is simultaneously compressed and sampled with low complexity by an untrusted bandwidth-constrained channel provider. Additionally, we design an accompanying access password as a defence layer, and it can further enhance security. Finally, an extension orthogonal matching pursuit (OMP) recovery algorithm is investigated by avoiding pseudo-inverse and multiple encryption and decryption to reduce computational complexity, named MIF OMP (MIFOMP). Theoretical analyses and simulation results demonstrate the proposed scheme can achieve high security, low-complexity sampling and recovery, and satisfy the expected recovery performance.
ISSN:0030-4026
1618-1336
DOI:10.1016/j.ijleo.2023.170677