
For a secure multimedia data exchange, watermarking is used. Generally, meta-heuristic optimization is required to optimize scheme parameters in the watermarking embedding. Even though meta-heuristic methods have been widely used because of their enhancing capability, due to their large time consumption nature they are not applicable for time-sensitive applications. This paper proposes a time efficient optimization method based on machine learning algorithms to detect the best embedding parameter for image watermarking with both robustness and imperceptibility. Initially, for providing robustness against watermarking attacks, a method for watermarking embedding is designed in the domain of Discrete Cosine Transform. After that, Ant Colony optimization is used for finding the optimization parameters. Then an observation data is obtained, which includes the feature vector and optimum strength values of the training images. The image features are extracted at different embedded strength values by the calculation of optimum fitness function. Finally Light Gradient Boosting algorithm (LGBA) is applied to predict the optimum embedding parameters of the set of new images which are to be watermarked. When compared with the existing optimization methods, it has been found that the proposed method consumes very less time for the evaluation of optimum solutions. From the results, it has been identified that the proposed algorithm satisfies the image watermarking with the improvement in time enhancement. The effectiveness of the proposed method is analyzed using MATLAB 2018b.
Ant colony optimization, Electronic computers. Computer science, Light gradient boosting algorithm, Image watermarking, Fitness function, QA75.5-76.95, Time enhancement
Ant colony optimization, Electronic computers. Computer science, Light gradient boosting algorithm, Image watermarking, Fitness function, QA75.5-76.95, Time enhancement
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 41 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 1% |
