TY - JOUR
T1 - Recent development of hashing-based image retrieval in non-stationary environments
AU - Li, Qihua
AU - Tian, Xing
AU - Ng, Wing W. Y.
AU - Kwong, Sam
PY - 2022/12
Y1 - 2022/12
N2 - With the continuous development of mobile devices, the number of images on the Internet increases explosively. Hashing methods solve retrieval problems with large datasets by converting images into binary hash codes. However,the image dataset on the Internet is updating and its data distribution may change as time goes by. In this situation, the retrieval effectiveness of ordinary hashing methods designed for stationary environments will decline. Thus, hashing methods for non-stationary environments are developed to learn from newly arrived data and adapt to new data environments for better retrieval accuracy in non-stationary environments. In this paper, goals of ideal hashing methods for non-stationary environments are proposed. State-of-the-art hashing methods for non-stationary environments are introduced and analyzed for their advantages and disadvantages according to goals. Experiments are presented to show characteristics of these methods. Suggestions for future development of non-stationary hashing are also given at the end of this paper.
AB - With the continuous development of mobile devices, the number of images on the Internet increases explosively. Hashing methods solve retrieval problems with large datasets by converting images into binary hash codes. However,the image dataset on the Internet is updating and its data distribution may change as time goes by. In this situation, the retrieval effectiveness of ordinary hashing methods designed for stationary environments will decline. Thus, hashing methods for non-stationary environments are developed to learn from newly arrived data and adapt to new data environments for better retrieval accuracy in non-stationary environments. In this paper, goals of ideal hashing methods for non-stationary environments are proposed. State-of-the-art hashing methods for non-stationary environments are introduced and analyzed for their advantages and disadvantages according to goals. Experiments are presented to show characteristics of these methods. Suggestions for future development of non-stationary hashing are also given at the end of this paper.
KW - Hashing
KW - Non-stationary environments
KW - Online hashing
KW - Survey
UR - http://www.scopus.com/inward/record.url?scp=85136541950&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85136541950&origin=recordpage
U2 - 10.1007/s13042-022-01630-7
DO - 10.1007/s13042-022-01630-7
M3 - RGC 21 - Publication in refereed journal
SN - 1868-8071
VL - 13
SP - 3867
EP - 3886
JO - International Journal of Machine Learning and Cybernetics
JF - International Journal of Machine Learning and Cybernetics
IS - 12
ER -