Novel Fragile FRFT Watermarking Algorithm Based on Blocking Method

Chang-Yong Liu; Lin-Lin Tang; Jeng-Shyang Pan

Found an issue? Give us feedback

https://doi.org/10.1...arrow_drop_down

https://doi.org/10.1109/cmcsn....

Article . 2012 . Peer-reviewed

Data sources: Crossref

https://dx.doi.org/10.1109/cmc...

Article

Data sources: Microsoft Academic Graph

Novel Fragile FRFT Watermarking Algorithm Based on Blocking Method

descriptionPublicationkeyboard_double_arrow_right Article 01 Jul 2012Publisher:IEEEJournal:2012 International Conference on Computing, Measurement, Control and Sensor Network

Authors: Chang-Yong Liu; Lin-Lin Tang; Jeng-Shyang Pan;

doi: 10.1109/cmcsn.2012.66

Novel Fragile FRFT Watermarking Algorithm Based on Blocking Method

- Summary
- Metrics

Abstract

novel fragile watermarking algorithm is proposed based on the Fractional Fourier Transform (FRFT) and the blocking method in this paper. Chaotic sequence is converted into a binary 0, 1 sequence to be used as the watermarking information. The blocking method for fragile watermarking algorithm is used to generate the initial value of the chaotic sequence. Good performance in experiments shows its excellent function for preventing tampering.

Related Organizations

Harbin Institute of Technology
China (People's Republic of)

Impact byBIP!

	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).	2
	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.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average