An efficient watermarking algorithm for digital audio data in security applications.

Transform-domain audio watermarking systems are more robust than time-domain systems. However, the main weakness of these systems is their high computational cost, especially for long-duration audio signals. Therefore, they are not desirable for real-time security applications where speed is a critical factor.

Optimal reconstruction and compression of signals and images by Hahn moments and artificial bee Colony (ABC) algorithm.

In this paper, we present an efficient and optimal method for optimization of Hahn parameters and using the Artificial Bee Colony algorithm (ABC) in order to improve the quality of reconstruction and the compression of bio-signals and color images of large sizes. The proposed methods are essentially based on two concepts: the development of a recursive calculation of the initial terms of Hahn polynomials in order to avoid the problems of instability of polynomial values and the use of ABC algorithm to optimize the values of the parameters and of the discrete orthogonal Hahn polynomials () during the reconstruction and the compression of bio-signals and color images. The simulation results performed on bio-signals and on large size / color images clearly show the efficiency and superiority of the proposed methods over conventional methods in terms of reconstruction of signals and images.

Robust 2D and 3D images zero - watermarking using dual Hahn moment invariants and Sine Cosine Algorithm.

In this paper, we initially provide significant improvements on the computational aspects of dual Hahn moment invariants (DHMIs) in both 2D and 3D domains. These improvements ensure the numerical stability of DHMIs for large-size images. Then, we propose an efficient method for optimizing the local parameters of dual Hahn polynomials (DHPs) when computing DHMIs using the Sine-Cosine Algorithm (SCA).

Fast and stable computation of higher-order Hahn polynomials and Hahn moment invariants for signal and image analysis.

This article presents, on the one hand, new algorithms for the fast and stable computation of discrete orthogonal Hahn polynomials of high order (HPs) based on the elimination of all gamma and factorial functions that cause the numerical fluctuations of HPs, and based on the use of appropriate stability conditions. On the other hand, a new method for the fast and numerically stable computation of Hahn moment invariants (HMIs) is also proposed. This method is mainly based on the use of new recursive relations of HPs and of matrix multiplications when calculating HMIs.