Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
2012 | 10.1109/TIP.2012.2187671 | IEEE Transactions on Image Processing |
Keywords | Field | DocType |
random number generation,decoding,image compression,image reconstruction,hadamard transform,image resolution,cryptography,encryption | Computer vision,Data set,Pattern recognition,Coding (social sciences),Encryption,Pixel,Artificial intelligence,Encoder,Decoding methods,Hadamard transform,Image compression,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 6 | 1941-0042 |
Citations | PageRank | References |
22 | 1.15 | 12 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Xinpeng Zhang | 1 | 2541 | 174.68 |
Guorui Feng | 2 | 223 | 23.26 |
Yanli Ren | 3 | 247 | 24.83 |
Zhenxing Qian | 4 | 43 | 4.24 |