{"title":"Robust image hashing based on SPIHT","authors":"Shih-Hsuan Yang, Chin-Feng Chen","doi":"10.1109/ITRE.2005.1503078","DOIUrl":null,"url":null,"abstract":"Media hashing is an important resolving skill of copyright infringement. In this paper, a novel robust image hashing scheme is proposed. The set partitioning in hierarchical trees (SPIHT) algorithm, widely employed in image compression, is used to extract the identification information of images. The sorting pass of SPIHT records the spatial distribution of significant wavelet coefficients, termed the significance map. We build the hash values from the significance maps and the associated autocorrelograms. To verify the robustness of the proposed methods, experiments are conducted on the Stir mark benchmarking system. The proposed hash sequence in autocorrelogram achieves good performance with reasonable complexity.","PeriodicalId":338920,"journal":{"name":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-06-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ITRE 2005. 3rd International Conference on Information Technology: Research and Education, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITRE.2005.1503078","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17
Abstract
Media hashing is an important resolving skill of copyright infringement. In this paper, a novel robust image hashing scheme is proposed. The set partitioning in hierarchical trees (SPIHT) algorithm, widely employed in image compression, is used to extract the identification information of images. The sorting pass of SPIHT records the spatial distribution of significant wavelet coefficients, termed the significance map. We build the hash values from the significance maps and the associated autocorrelograms. To verify the robustness of the proposed methods, experiments are conducted on the Stir mark benchmarking system. The proposed hash sequence in autocorrelogram achieves good performance with reasonable complexity.