DocumentCode
613733
Title
Discrete Gould transform - Fast realisations and data hiding
Author
Skodras, A.N.
Author_Institution
Sch. of Sci. & Technol., Hellenic Open Univ., Patras, Greece
fYear
2013
fDate
25-25 Jan. 2013
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
computational complexity; data encapsulation; discrete transforms; edge detection; DGT; computational complexity; data hiding method; digital imaging; discrete Gould transform; edge detection;
fLanguage
English
Publisher
iet
Conference_Titel
Signal Processing (CIWSP 2013), 2013 Constantinides International Workshop on
Conference_Location
London
Electronic_ISBN
978-1-84919-733-5
Type
conf
DOI
10.1049/ic.2013.0003
Filename
6550157
Link To Document