基于多重随机k维树地震搜索引擎的建立
详细信息 本馆镜像全文    |  推荐本文 | | 获取馆网全文
摘要
描述了数据库的构建、利用多重随机k维树建立地震搜索引擎的过程。通过实际搜索测试,证明了利用地震搜索引擎确定震源信息的可行性,并探讨了其存在的问题及相应的改进措施。结果表明,地震搜索引擎能够自动、快速的确定震源信息,具有很强的实用性。
The process to build a database and set up the earthquake search engine by using multiple randomized KD-Tree was described in this paper. And by practical tests, the feasibility of finding focal information by earthquake search engine was proved. There was also discussion of the existing problems and the measures for improvement. The result shows that earthquake search engine can find focal information automatically and quickly. It has a very strong practicability.
引文
[1]丁南南,刘艳滢,张叶,等.基于SURF-DAISY算法和随机kd树的快速图像配准[J].光电子·激光,2012.23(7):1395-1402
    [2]李晓明,闫宏飞,王继民.搜索引擎原理,技术与系统[M].科学出版社,2005.
    [3]徐宝文,张卫丰,等.搜索引擎与信息获取技术[M].清华大学出版社,2003.
    [4]Pujari A K.Data mining techniques[M].Universities press,2001.
    [5]Bentley J L.Multidimensional binary search trees used for associative searching[J].Communications of the ACM,1975,18(9):509-517.
    [6]Muja M,Lowe D G.Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration[C]//VISAPP(1),2009:331-340.
    [7]Jia Y,Wang J,Zeng G,et al.Optimizing kd-trees for scalable visual descriptor indexing[C]//Computer Vision and Pattern Recognition(CVPR),2010 IEEE Conference on.IEEE,2010:3392-3399.

版权所有:© 2023 中国地质图书馆 中国地质调查局地学文献中心