Optimized multimedia data through computationally intelligent algorithms

In the field of data exchange, the security of information is the critical aspect. This void in the security helped the evolution of steganography to address the problem of security, especially when highly critical information exchange is the priority. Better and advanced level of security has been...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Multimedia systems Ročník 29; číslo 5; s. 2961 - 2977
Hlavní autoři: Sharma, Neha, Chakraborty, Chinmay, Kumar, Rajeev
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer Berlin Heidelberg 01.10.2023
Springer Nature B.V
Témata:
ISSN:0942-4962, 1432-1882
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í:In the field of data exchange, the security of information is the critical aspect. This void in the security helped the evolution of steganography to address the problem of security, especially when highly critical information exchange is the priority. Better and advanced level of security has been attained using the techniques of steganography with cryptography. However, it has been observed that steganographic techniques principled on computationally intelligent or inspired by nature algorithms are gaining much attention. The paper proposes a method for image steganography in transform domain using hybridization of two computationally intelligent algorithms, i.e., firefly optimization algorithm and ant colony optimization algorithm with Huffman encoding to address the gap of high payload. Comparative analysis of the proposed steganographic tool with other existing methods and analysis of the values obtained against some key performance terms like PSNR (peak signal to noise ratio), MSE (mean square error), BER (bit error rate) and SSI (structural similarity index) determines the proposed algorithm as a powerful method. The proposed tool achieves the PSNR of 68.06 dB and the embedding capacity of 985,682 bits.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0942-4962
1432-1882
DOI:10.1007/s00530-022-00918-6