3898 search results - page 245 / 780 » On the Bit Extraction Problem |
114
click to vote
ICMCS
2005
IEEE
15 years 9 months ago
2005
IEEE
Random geometric distortion is one of the most difficult kinds of image processing to survive and has been a noted problem in watermarking research. Previous methods for dealing ...
114
Voted
SIGECOM
2005
ACM
15 years 9 months ago
2005
ACM
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
130
click to vote
SPAA
2005
ACM
15 years 9 months ago
2005
ACM
A weighted undirected network is ∆ growth-bounded if the number of nodes at distance 2r around any given node is at most ∆ times the number of nodes at distance r around the n...
126
click to vote
DRM
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents an efficient blind watermark detection/decoding scheme for spread spectrum (SS) based watermarking, exploiting the fact that in SS-based embedding schemes the ...
111
click to vote
ICIAR
2005
Springer
15 years 9 months ago
2005
Springer
As digitalized content rapidly proliferates in networked systems, content security necessarily arises as one of the most important issues. Many developers have studied techniques ...