{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:42:04Z","timestamp":1770741724184,"version":"3.49.0"},"publisher-location":"California","reference-count":0,"publisher":"International Joint Conferences on Artificial Intelligence Organization","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,8]]},"abstract":"<jats:p>Hashing can compress high-dimensional data into compact binary codes, while preserving the similarity, to facilitate efficient retrieval and storage.\nHowever, when retrieving using an extremely short length hash code learned by the existing methods, the performance cannot be guaranteed because of\nsevere information loss. To address this issue, in this study, we propose a novel supervised short-length hashing (SSLH). In this proposed SSLH, mutual reconstruction between the short-length hash codes and original features are performed to reduce semantic loss. Furthermore, to enhance the robustness\nand accuracy of the hash representation, a robust estimator term is added to fully utilize the label information. Extensive experiments conducted on four\nimage benchmarks demonstrate the superior performance of the proposed SSLH with short-length hash codes. In addition, the proposed SSLH outperforms\nthe existing methods, with long-length hash codes. To the best of our knowledge, this is the first linear-based hashing method that focuses on both short and long-length hash codes for maintaining high precision.<\/jats:p>","DOI":"10.24963\/ijcai.2019\/420","type":"proceedings-article","created":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:46:05Z","timestamp":1564299965000},"page":"3031-3037","source":"Crossref","is-referenced-by-count":30,"title":["Supervised Short-Length Hashing"],"prefix":"10.24963","author":[{"given":"Xingbo","family":"Liu","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Shandong University, Jinan, P.R. China"}]},{"given":"Xiushan","family":"Nie","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong Jianzhu University, Jinan, P.R. China"}]},{"given":"Quan","family":"Zhou","sequence":"additional","affiliation":[{"name":"School of Software, Shandong University, Jinan, P.R. China"}]},{"given":"Xiaoming","family":"Xi","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Shandong Jianzhu University, Jinan, P.R. China"}]},{"given":"Lei","family":"Zhu","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Shandong Normal University, Jinan, P.R. China"}]},{"given":"Yilong","family":"Yin","sequence":"additional","affiliation":[{"name":"School of Software, Shandong University, Jinan, P.R. China"}]}],"member":"10584","event":{"name":"Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}","theme":"Artificial Intelligence","location":"Macao, China","acronym":"IJCAI-2019","number":"28","sponsor":["International Joint Conferences on Artificial Intelligence Organization (IJCAI)"],"start":{"date-parts":[[2019,8,10]]},"end":{"date-parts":[[2019,8,16]]}},"container-title":["Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence"],"original-title":[],"deposited":{"date-parts":[[2019,7,28]],"date-time":"2019-07-28T07:49:10Z","timestamp":1564300150000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ijcai.org\/proceedings\/2019\/420"}},"subtitle":[],"proceedings-subject":"Artificial Intelligence Research Articles","short-title":[],"issued":{"date-parts":[[2019,8]]},"references-count":0,"URL":"https:\/\/doi.org\/10.24963\/ijcai.2019\/420","relation":{},"subject":[],"published":{"date-parts":[[2019,8]]}}}