Services on Demand
Journal
Article
Indicators
- Cited by SciELO
- Access statistics
Related links
- Similars in SciELO
Share
Computación y Sistemas
On-line version ISSN 2007-9737Print version ISSN 1405-5546
Abstract
GARCIA CANO, Edgar and RODRIGUEZ, Katya. A Parallel PSO Algorithm for a Watermarking Application on a GPU. Comp. y Sist. [online]. 2013, vol.17, n.3, pp.381-390. ISSN 2007-9737.
In this paper, a research about the usability, advantages and disadvantages of using Compute Unified Device Architecture (CUDA) is presented, implementing an algorithm based on populations called Particle Swarm Optimization (PSO) [5]. In order to test the performance of the proposed algorithm, a hide watermark image application is put into practice. The PSO is used to optimize the positions where a watermark has to be inserted. This application uses the insertion/extraction algorithm proposed by Shieh et al. [1]. This algorithm was implemented for both sequential and CUDA architectures. The fitness function-used in the optimization algorithm-has two objectives: fidelity and robustness. The measurement of fidelity and robustness is computed using Mean Squared Error (MSE) and Normalized Correlation (NC), respectively; these functions are evaluated using Pareto dominance.
Keywords : Parallel particle swarm optimization; watermarking; CUDA; image security.