Referenced Items are not available for this document.
In this letter, a novel video hashing algorithm is proposed, in which the weighted hash matching is defined in video hashing for the first time. In the proposed algorithm, the video hash is generated based on the ordinal feature derived from the temporally informative representation image (TIRI). At the same time the representative saliency map (RSM) is constructed by the visual saliency maps in video segments, and it generates the hash weights for hash matching. During hash matching, the traditional bit error rate (BER) is weighted with hash weights to form the weighted error rate (WER). WER is used to measure the similarity between different hashes. Experiments on different kinds of videos with different kinds of attacks verify the robustness and discrimination of the proposed algorithm.
Published in:
Signal Processing Letters, IEEE
(Volume:19
,
Issue:
6
)
Date of Publication: June 2012
- Page(s):
- 328 - 331
- ISSN :
- 1070-9908
- INSPEC Accession Number:
- 12650424
- Digital Object Identifier :
- 10.1109/LSP.2012.2192271
- Date of Publication :
- 03 April 2012
- Date of Current Version :
- 09 April 2012
- Issue Date :
- June 2012
- Sponsored by :
- IEEE Signal Processing Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
