Please use this identifier to cite or link to this item:
Title: Watermarking with retrieval systems
Authors: Roy, S.
Chang, E.-C. 
Keywords: k-mean
Multimedia retrieval systems
Multimedia security
Nearest-neighbor search
Issue Date: 2004
Citation: Roy, S., Chang, E.-C. (2004). Watermarking with retrieval systems. Multimedia Systems 9 (5) : 433-440. ScholarBank@NUS Repository.
Abstract: We are interested in the problem of associating messages with multimedia content for the purpose of identifying them. This problem can be addressed by a watermarking system that embeds the associated messages into the multimedia content (also called Work). 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 introduced when a retrieval system is used, the overhead of searching in large databases is fundamentally difficult (also known as the dimensionality curse). In this paper we present a novel framework that strikes a trade-off between watermarking and retrieval systems. Our 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 "active clustering".
Source Title: Multimedia Systems
ISSN: 09424962
DOI: 10.1007/s00530-003-0116-1
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Mar 25, 2019


checked on Mar 18, 2019

Page view(s)

checked on Mar 24, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.