Evolutionary Algorithms and Efficient Data Analytics for Image Processing

• Published in: 2021 15th International Conference on Ubiquitous Information Management and Communication (IMCOM) pp. 1 - 8
• Main Authors: Mohammadi, Farid Ghareh, Shenavarmasouleh, Farzan, Amini, M. Hadi, Arabnia, Hamid R.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 04.01.2021
• Subjects: Curse of dimensionality; Data science; Dimension reduction; Evolutionary computation; Feature extraction; Feature selection; Image classification; Image steganalysis; Machine learning algorithms; NP-hard problem; Optimization; Real-time systems; Visualization
• DOI: 10.1109/IMCOM51814.2021.9377426

Steganography algorithms facilitate communication between a source and a destination in a secret manner. This is done by embedding messages/text/data into images without impacting the appearance of the resultant images/videos. Ste-ganalysis is the science of determining if an image has secret messages embedded/hidden in it. Because there are numerous steganography algorithms, and since each one of them requires a different type of steganalysis, the steganalysis process is extremely challenging. Thus, researchers aim to develop one universal steganalysis to detect all steganography algorithms. Universal steganalysis extracts a large number of features to distinguish stego images from cover images. However, this leads to the problem of the curse of dimensionality (CoD), which is considered to be an NP-hard problem. Generating a machine learning based model also takes a long time which makes real-time processing appear impossible in any optimization for time-intensive fields such as visual computing. In this study, we investigate previously developed evolutionary algorithms for boosting real-time image processing and argue that they provide the most promising solutions for the CoD problem.