Please use this identifier to cite or link to this item:
|Title:||Watermarking with retrieval systems|
|Authors:||Chang, E.-C. |
Watermarking and nearest-neighbour search
|Source:||Chang, E.-C.,Roy, S. (2002). Watermarking with retrieval systems. ACM Multimedia 2002 Workshop W2 - Workshop on Multimedia and Security: Authentication, Secrecy, and Steganalysis : 43-46. ScholarBank@NUS Repository.|
|Abstract:||We are interested in the problem of associating messages to multimedia content. This problem can be addressed by a watermarking system which embeds the associated messages into the multimedia content (also called Works). A drawback of watermarking is that the content will be distorted during embedding. On the other hand, if we assume that the database is available, the problem can be addressed by a retrieval system. Although no undesirable distortion is created, searching in large databases is fundamentally difficult (also known as the dimensionality curse). In this paper we present a novel framework which strikes a tradeoff between watermarking and retrieval systems. The framework avoids the dimensionality curse by introducing small distortions (watermark) into the multimedia content. From another perspective, the framework improves the watermarking performance, marked by significant reduction in distortion, by introducing searching ability in the message detection stage. To prove the concept, we give an algorithm based on the proposed notion of "clustering by watermarking".|
|Source Title:||ACM Multimedia 2002 Workshop W2 - Workshop on Multimedia and Security: Authentication, Secrecy, and Steganalysis|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Dec 9, 2017
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.