In contrast with UKF, the standard CKF can solve high-dimensional nonlinear filter problems. However, when the nonlinear systematic dimension increases, the accuracy of CKF will decline and the computational cost will increase rapidlly. Two-Stage Kalman filter can solve this problem, but it only applies to linear systems. This paper proposes a two-stage Cubature Kalman filter (TSCKF) which can solve high-dimensional nonlinear systems with random bias. The estimate of the TSCKF can be expressed as the output of the bias free filter and bias filter. The bias free filter doesn't consider the bias and its output is corrected by the bias filter. In comparison with Augmented state Cubature Kalman Filter (ASCKF), the TSCKF avoids dimension disaster effectively and has little computation to solve high-dimensional nonlinear filter problem.
Compared with pairwise/triplet similarity based hashing, central similarity based hashing can capture data relationships more efficiently. However, previous works still have the limitation of feature expression capability due to information redundancy and they simply use similar/dissimilar label pairs so that they cannot fully capture the complex semantic information of the visual content, which limits the retrieval performance to some extent. To address the above issues, an attention-based hashing with central similarity learning (ACSH) for image retrieval is proposed. Firstly, it uses an off-the-shelf algorithm to generate semantic hash centers with sufficient hamming distance between each other for data points. Secondly, it embeds a spatial attention mechanism into the feature extraction module, enabling the deep hashing network to focus on important features and suppress unimportant features. Finally, in the training phase, a classification task is introduced to supervise the feature learning of the spatial attention mechanism to capture more complex semantic information of the visual content. Comprehensive empirical evidence shows that ACSH has better retrieval performance than the existing deep hashing methods based on central similarity on three standard benchmarks.