论文信息 - Discrete Gould transform - Fast realisations and data hiding

Discrete Gould transform - Fast realisations and data hiding

The computational complexity of the discrete Gould transform (DGT) is studied and a fast realisation approach is proposed. The reversible difference expansion data hiding method is applied to the DGT coefficients and experimental results are given. (4 pages)

Athanassios N. Skodras

[1] Athanassios N. Skodras,et al. A discrete Gould transform data hiding scheme , 2014 .

[2] Maurice F. Aburdene,et al. The discrete Gould transform and its applications , 2006, Electronic Imaging.

[3] A. Skodras. Fast discrete Pascal transform , 2006 .

[4] Jun Tian,et al. Reversible data embedding using a difference expansion , 2003, IEEE Trans. Circuits Syst. Video Technol..