Robust image hashing based on low-rank and sparse decomposition
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
We propose in this paper a low-rank and sparse decomposition based image hashing algorithm, aiming to summarize the structural information and sparse salient components of digital image to compact digest. More specifically, we leverage compressive sampling and random projection to separately aggregate the low-rank approximation of input image and the spatial layout of salient components into binary hash. Owing to its capability of capturing and fusing intrinsic visual characteristics, the proposed work demonstrates high robustness and discriminability. As observed in content identification experiments, it shows much higher accuracy than state-of-the-art algorithms. Furthermore, we also analytically evaluate the security of the proposed hashing algorithm using the entropy based metric, and its performance in content identification is analyzed using the channel coding theorem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Robust and secure image hashing
Swaminathan, A., Mao, Y., & Wu, M. (2006) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2006.873601 · Cited by 552
Top-down and bottom-up mechanisms in biasing competition in the human brain
Beck, D. M., & Kastner, S. (2009) · Vision Research · doi:10.1016/j.visres.2008.07.012 · Cited by 444 · cited 2×
“Salient regions are those win the competition for the priorities of information processing [20]; hence, they tend to be very sparse and show remarkable contrast with neighbors.”
BackgroundPerceptual Image Hashing Via Feature Points: Performance Evaluation and Tradeoffs
Monga, V., & Evans, B. L. (2006) · IEEE Transactions on Image Processing · doi:10.1109/tip.2006.881948 · Cited by 363 · cited 2×
“Some commonly used features include statistics [1–3], frequency-domain coefficients [4–6], matrix invariance [7, 8] and key points [9, 10].”
Background
Cited by
Robust image hashing with multidimensional scaling
Tang, Z., Huang, Z., Zhang, X., & Lao, H. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.02.008 · Cited by 80
Qin, C., Liu, E., Feng, G., & Zhang, X. (2021) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2020.3047142 · Cited by 78
Robust and Secure Image Fingerprinting Learned by Neural Network
Li, Y., Wang, D., & Tang, L. (2020) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2019.2890966 · Cited by 52
Self-citation
Metadata
- Authors
- Li, Y., & Wang, P.
- Venue
- 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
- Publisher
- IEEE
- Published
- 2016-03
- Pages
- 2154-2158
- ISSN
- 1520-6149 (ISSN-L)
- OpenAlex
- W2396209768
- Cited by
- 37
- References
- 3
- FWCI
- 2.82
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Robust image hashing based on low-rank and sparse decomposition. https://app.cochat.ai/papers/10.1109/icassp.2016.7472058
- The paper
- Li, Y., & Wang, P. (2016). Robust image hashing based on low-rank and sparse decomposition. 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). https://doi.org/10.1109/icassp.2016.7472058
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.