Searching for maritime moving targets using satellites is an attracting but rather difficult problem due to the satellites' orbits and discontinuous visible time windows.From a long term cyclic view,a non-myopic m...Searching for maritime moving targets using satellites is an attracting but rather difficult problem due to the satellites' orbits and discontinuous visible time windows.From a long term cyclic view,a non-myopic method based on reinforcement learning(RL)for multi-pass multi-targets searching was proposed.It learnt system behaviors step by step from each observation which resulted in a dynamic progressive way.Then it decided and adjusted optimal actions in each observation opportunity.System states were indicated by expected information gain.Neural networks algorithm was used to approximate parameters of control policy.Simulation results show that our approach with sufficient training performs significantly better than other myopic approaches which make local optimal decisions for each individual observation opportunity.展开更多
Although the distance between binary codes can be computed fast in Hamming space, linear search is not practical for large scale datasets. Therefore attention has been paid to the efficiency of performing approximate ...Although the distance between binary codes can be computed fast in Hamming space, linear search is not practical for large scale datasets. Therefore attention has been paid to the efficiency of performing approximate nearest neighbor search, in which hierarchical clustering trees （HCT） are widely used. However, HCT select cluster centers randomly and build indexes with the entire binary code, this degrades search performance. In this paper, we first propose a new clustering algorithm, which chooses cluster centers on the basis of relative distances and uses a more homogeneous partition of the dataset than HCT has to build the hierarchical clustering trees. Then, we present an algorithm to compress binary codes by extracting distinctive bits according to the standard deviation of each bit. Consequently, a new index is proposed using compressed binary codes based on hierarchical decomposition of binary spaces. Experiments conducted on reference datasets and a dataset of one billion binary codes demonstrate the effectiveness and efficiency of our method.展开更多
基金National Natural Science Foundation of China(No.61203180)
文摘Searching for maritime moving targets using satellites is an attracting but rather difficult problem due to the satellites' orbits and discontinuous visible time windows.From a long term cyclic view,a non-myopic method based on reinforcement learning(RL)for multi-pass multi-targets searching was proposed.It learnt system behaviors step by step from each observation which resulted in a dynamic progressive way.Then it decided and adjusted optimal actions in each observation opportunity.System states were indicated by expected information gain.Neural networks algorithm was used to approximate parameters of control policy.Simulation results show that our approach with sufficient training performs significantly better than other myopic approaches which make local optimal decisions for each individual observation opportunity.
文摘Although the distance between binary codes can be computed fast in Hamming space, linear search is not practical for large scale datasets. Therefore attention has been paid to the efficiency of performing approximate nearest neighbor search, in which hierarchical clustering trees （HCT） are widely used. However, HCT select cluster centers randomly and build indexes with the entire binary code, this degrades search performance. In this paper, we first propose a new clustering algorithm, which chooses cluster centers on the basis of relative distances and uses a more homogeneous partition of the dataset than HCT has to build the hierarchical clustering trees. Then, we present an algorithm to compress binary codes by extracting distinctive bits according to the standard deviation of each bit. Consequently, a new index is proposed using compressed binary codes based on hierarchical decomposition of binary spaces. Experiments conducted on reference datasets and a dataset of one billion binary codes demonstrate the effectiveness and efficiency of our method.
