This paper deals with the issues of color videos in-compression encryption, this done by using the optimized multiple Huffman table (OMHT) technique, will be elucidated upon in order to compress and encrypt both color images and videos. On an average, our algorithm takes only 2 ms of encryption time per frame. Computational complexity of the encryption is made proportional to the influence of the DCT coefficients on the visual content. We achieve computational efficiency by exploiting the frequently occurring patterns in the DCT coefficients of the video data. This makes secure video encryption feasible for real-time applications without any extra dedicated hardware. In this paper, we propose a computationally efficient and secure video encryption algorithm. Security and privacy issues of the transmitted data have become an important concern in multimedia technology.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |