Scalable Coding of Encrypted Images

This paper proposes a novel scheme of scalable coding for encrypted images. In the encryption phase, the original pixel values are masked by a modulo-256 addition with pseudorandom numbers that are derived from a secret key. After decomposing the encrypted data into a downsampled subimage and severa...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on image processing Ročník 21; číslo 6; s. 3108 - 3114
Hlavní autoři: Zhang, Xinpeng, Feng, Guorui, Ren, Yanli, Qian, Zhenxing
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York, NY IEEE 01.06.2012
Institute of Electrical and Electronics Engineers
Témata:
Applied sciences
Coding, codes
Cryptography
Decoding
Educational institutions
Encryption
Exact sciences and technology
Hadamard transform
Image coding
image compression
image encryption
Image processing
Image reconstruction
Image resolution
Information, signal and communications theory
scalable coding
Signal and communications theory
Signal processing
Telecommunications and information theory
Image processing
Scalability
Coding circuit
Data compression
Pseudorandom number
Updating
Iterative method
Image compression
Encryption
image encryption
Image coding
Security of data
Hadamard transformation
Secret key
Hadamard transform
scalable coding
ISSN:1057-7149, 1941-0042, 1941-0042
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í:This paper proposes a novel scheme of scalable coding for encrypted images. In the encryption phase, the original pixel values are masked by a modulo-256 addition with pseudorandom numbers that are derived from a secret key. After decomposing the encrypted data into a downsampled subimage and several data sets with a multiple-resolution construction, an encoder quantizes the subimage and the Hadamard coefficients of each data set to reduce the data amount. Then, the data of quantized subimage and coefficients are regarded as a set of bitstreams. At the receiver side, while a subimage is decrypted to provide the rough information of the original content, the quantized coefficients can be used to reconstruct the detailed content with an iteratively updating procedure. Because of the hierarchical coding mechanism, the principal original content with higher resolution can be reconstructed when more bitstreams are received.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Correspondence-1
content type line 23
ISSN:1057-7149
1941-0042
1941-0042
DOI:10.1109/TIP.2012.2187671