Learning to hash is generating similarity-preserving binary representations of images, which is, among others, an efficient way for fast image retrieval. Two-step hashing has become a common approach because it simplifies the learning by separating binary code inference from hash function training. However, the binary code inference typically leads to an intractable optimization problem with binary constraints. Different relaxation methods, which are generally based on complicated optimization techniques, have been proposed to address this challenge. In this paper, a simple relaxation scheme based on the projected gradient is proposed. To this end in each iteration, we try to update the optimization variable as if there is no binary constraint and then project the updated solution to the feasible set. We formulate the projection step as fining closet binary matrix to the updated matrix and take advantage of the closed-form solution for the projection step to complete our learning algorithm. Inspired by opposition-based learning, pairwise opposite weights between data points are incorporated to impose a stronger penalty on data instances with higher misclassification probability in the proposed objective function. We show that this simple learning algorithm leads to binary codes that achieve competitive results on both CIFAR-10 and NUS-WIDE datasets compared to state-of-the-art benchmarks.
Recently, steady-state visual evoked potential (SSVEP)-based brain-computer interface (BCI) has attracted much attention due to its high information transfer rate (ITR) and increasing number of targets. However, the performance of SSVEP-based methods in terms of accuracy and time length required for target detection can be improved. We propose a new canonical correlation analysis (CCA)-based method to integrate subject-specific models and subject-independent information and enhance BCI performance. To optimize hyperparameters for CCA-based model of a specific subject, we propose to use training data of other subjects. An ensemble version of the proposed method is also developed and used for a fair comparison with ensemble task-related component analysis (TRCA). A publicly available 35-subject SSVEP benchmark dataset is used to evaluate different methods. The proposed method is compared with TRCA and extended CCA methods as reference methods. The performance of the methods is evaluated using classification accuracy and ITR. Offline analysis results show that the proposed method reaches highest ITR compared with TRCA and extended CCA. Also, the proposed method significantly improves performance of extended CCA in all conditions and TRCA for time windows greater than 0.3 s. In addition, the proposed method outperforms TRCA for low number of training blocks and electrodes. This study illustrates that adding subject-independent information to subject-specific models can improve the performance of SSVEP-based BCIs.
In the era of big data, methods for improving memory and computational efficiency have become crucial for successful deployment of technologies. Hashing is one of the most effective approaches to deal with computational limitations that come with big data. One natural way for formulating this problem is spectral hashing that directly incorporates affinity to learn binary codes. However, due to binary constraints, the optimization becomes intractable. To mitigate this challenge, different relaxation approaches have been proposed to reduce the computational load of obtaining binary codes and still attain a good solution. The problem with all existing relaxation methods is resorting to one or more additional auxiliary variables to attain high quality binary codes while relaxing the problem. The existence of auxiliary variables leads to coordinate descent approach which increases the computational complexity. We argue that introducing these variables is unnecessary. To this end, we propose a novel relaxed formulation for spectral hashing that adds no additional variables to the problem. Furthermore, instead of solving the problem in original space where number of variables is equal to the data points, we solve the problem in a much smaller space and retrieve the binary codes from this solution. This trick reduces both the memory and computational complexity at the same time. We apply two optimization techniques, namely projected gradient and optimization on manifold, to obtain the solution. Using comprehensive experiments on four public datasets, we show that the proposed efficient spectral hashing (ESH) algorithm achieves highly competitive retrieval performance compared with state of the art at low complexity.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.