期刊文献+

基于分散分配的非对称距离倒排索引机制研究

下载PDF
导出
摘要 随着计算机多媒体技术的快速发展,基于图像内容的检索逐渐成为了热点的研究问题。图像的特征描述和特征索引机制的建立是实现基于内容图像检索的关键。根据图像局部特征向量与聚类中心的相对距离,建立非对称距离计算倒排索引机制。为了进一步提高查询效率,本文将可能落入多条哈希链表中的数据库向量进行多次编码,实现了基于分散分配的非对称距离计算倒排索引机制。通过实验可以发现,这种索引机制可以有效的提升查询效率。
作者 宝航
出处 《电子技术与软件工程》 2016年第15期188-189,共2页 ELECTRONIC TECHNOLOGY & SOFTWARE ENGINEERING
  • 相关文献

参考文献6

二级参考文献43

  • 1Chang S K, Hsu A. Image information system: Where do we go from here? IEEE Transactions on Knowledge and Date Engineering, 1992, 4(5): 431-442.
  • 2Niblack W, Barber R, Equitz W, et al. The QBIC project: Querying images by content, using color, texture and shape//Proceedings of the SPIE Storage and Retrieval for Image and Video Databases. San Jose, USA, 1993:173-187.
  • 3Bach J, Fuller C, Gupta A. Virage image search engine: An open framework for image management//Proceedings of the SPIE Conference on Storage and Retrieval for Image and Vid- eo Databases IV. San Jose, USA, 1996:76-87.
  • 4Panigrahy Rina. Entropy based nearest neighbor search in high dimensions//Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms. Miami, USA, 2006.. 1186-1195.
  • 5Berchtold S, Ertl K B, Kriegel H P. The pyramid-technique: Towards breaking the curse of dimensionality//Proceedings of the 1998 ACM SIGMOD International Conference on Man- agement of data. Washington, USA, 1998:142-153.
  • 6Jegou Herve, Douze Matthifs, Schmid Cordelia. Aggregating local descriptors into a compact image representation//Pro- eeedings of the IEEE 23rd Conference on Computer Vision and Pattern Recognition. San Francisco, USA, 2010: 3304- 3311.
  • 7Perronnin F, Dance C R. Fisher kernels on visual vocabula- ries for image categorization//Proceedings of the IEEE 10th Conference on Computer Vision and Pattern Recognition. Minneapolis, USA, 2007:1-8.
  • 8Bentley J L. Multidimensional binary search trees used for associative Searching. Communications of the ACM, 1975, 18(9) : 509-517.
  • 9Raphael Finkel, Bentley J L. Quad trees: A data structure for retrieval of composite keys. Aeta Informatics, 1974, 4(1): 1-9.
  • 10Beckman N, Kriegel H, Schneider R. The R*-tree: An effi- cient and robust access method for points and rectangles// Proceedings of the 1990 ACM SIGMOD International Confer- ence on Management of Data. New Jersey, USA, 1990: 322- 331.

共引文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部