The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Graph PCA Hashing for Similarity Search
Open accessAbstract
This paper proposes a new hashing framework to conduct similarity search via the following steps: first, employing linear clustering methods to obtain a set of representative data points and a set of landmarks of the big dataset; second, using the landmarks to generate a probability representation for each data point. The proposed probability representation method is further proved to preserve the neighborhood of each data point. Third, PCA is integrated with manifold learning to lean the hash functions using the probability representations of all representative data points. As a consequence, the proposed hashing method achieves efficient similarity search (with linear time complexity) and effective hashing performance and high generalization ability (simultaneously preserving two kinds of complementary similarity structures, i.e., local structures via manifold learning and global structures via PCA). Experimental results on four public datasets clearly demonstrate the advantages of our proposed method in terms of similarity search, compared to the state-of-the-art hashing methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Small codes and large image databases for recognition
Torralba, A., Fergus, R., & Weiss, Y. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587633 · Cited by 727
Deep hashing for compact binary codes learning
Liong, V. E., Lu, J., Wang, G., Moulin, P., & Zhou, J. (2015) · 2015 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2015.7298862 · Cited by 545
Cited by
A Brief Survey on Semantic Segmentation with Deep Learning
Hao, S., Zhou, Y., & Guo, Y. (2020) · Neurocomputing · doi:10.1016/j.neucom.2019.11.118 · Cited by 596
Feature selection for text classification: A review
Deng, X., Li, Y., Weng, J., & Zhang, J. (2019) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6083-5 · Cited by 351
A novel k NN algorithm with data-driven k parameter computation
Zhang, S., Cheng, D., Deng, Z., Zong, M., & Deng, X. (2018) · Pattern Recognition Letters · doi:10.1016/j.patrec.2017.09.036 · Cited by 278
Self-citationOne-Step Multi-View Spectral Clustering
Zhu, X., Zhang, S., He, W., Hu, R., Lei, C., & Zhu, P. (2019) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2873378 · Cited by 265
Self-citationA brief review on multi-task learning
Thung, K.-H., & Wee, C.-Y. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6463-x · Cited by 263
Metadata
- Authors
- Zhu, X., Li, X., Zhang, S., Xu, Z., Yu, L., & Wang, C.
- Venue
- IEEE Transactions on Multimedia
- Published
- 2017-09
- Volume
- 19
- Issue
- 9
- Pages
- 2033-2044
- ISSN
- 1520-9210 (ISSN-L)
- 1941-0077
- OpenAlex
- W2614818206
- Cited by
- 190
- References
- 2
- FWCI
- 15.27
- Type
- journal article
- Language
- en
- Open access
- green
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: Graph PCA Hashing for Similarity Search. https://app.cochat.ai/papers/10.1109/tmm.2017.2703636
- The paper
- Zhu, X., Li, X., Zhang, S., Xu, Z., Yu, L., & Wang, C. (2017). Graph PCA Hashing for Similarity Search. IEEE Transactions on Multimedia. https://doi.org/10.1109/tmm.2017.2703636
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.