English 中文(简体)
Does there exist a digital image steganography algorithm which would be resistant to image manipulation?
原标题:

I m wondering - is there a steganography solution for digital images which is resistant to image manipulations? With "manipulations" I mean the most standard operations - recompressing JPEGs (or even changing file formats entirely), cropping and scaling. The application of this method would naturally be for image copyright protection.

I fully understand that the more image is manipulated the less are the chances that the steganographic watermark is intact, but at least some degree of resistance would be nice.

最佳回答

It seems to me, that this is just another move in the cat and mouse game, but here you are:

http://scien.stanford.edu/class/ee368/projects2000/project5/default.htm

From the conclusions:

"There will always be a tradeoff in watermark embedding. By which we mean tradeoff between robustness of the watermark verses the degradation of the image. At some point the strength of the watermark will cause the image to be degraded to a point, which will not be acceptable.

Depending on the technique used for watermarking, whether in spatial or frequency domain, the watermarked image showed, in general, robustness to the attacks of the same domain and weakness to the attacks in the opposite domain. Nakamura mentions these results in his work, and concludes that there is no method that will be robust in both domains, and that applying hybrid watermarking schemes will have worse results."

问题回答

暂无回答




相关问题
How to add/merge several Big O s into one

If I have an algorithm which is comprised of (let s say) three sub-algorithms, all with different O() characteristics, e.g.: algorithm A: O(n) algorithm B: O(log(n)) algorithm C: O(n log(n)) How do ...

Grokking Timsort

There s a (relatively) new sort on the block called Timsort. It s been used as Python s list.sort, and is now going to be the new Array.sort in Java 7. There s some documentation and a tiny Wikipedia ...

Manually implementing high performance algorithms in .NET

As a learning experience I recently tried implementing Quicksort with 3 way partitioning in C#. Apart from needing to add an extra range check on the left/right variables before the recursive call, ...

Print possible strings created from a Number

Given a 10 digit Telephone Number, we have to print all possible strings created from that. The mapping of the numbers is the one as exactly on a phone s keypad. i.e. for 1,0-> No Letter for 2->...

Enumerating All Minimal Directed Cycles Of A Directed Graph

I have a directed graph and my problem is to enumerate all the minimal (cycles that cannot be constructed as the union of other cycles) directed cycles of this graph. This is different from what the ...

Quick padding of a string in Delphi

I was trying to speed up a certain routine in an application, and my profiler, AQTime, identified one method in particular as a bottleneck. The method has been with us for years, and is part of a "...

热门标签