QQ客服 官方微博 反馈留言

	Spatial min-Hash for similar image search
	Qu, Yanyun ; Song, Shuyang ; Yang, Jiangjun ; Li, Jianmin ; Qu YY(曲延云)
	2013
关键词	Hamming distance Hash functions Image matching Internet
英文摘要	Conference Name:5th International Conference on Internet Multimedia Computing and Service, ICIMCS 2013. Conference Address: Huangshan, China. Time:August 17, 2013 - August 19, 2013.; Hefei University of Technology; National Natural Foundation of China; SIGMM China Chapter; We propose a spatial min-Hash algorithm that groups the minimal hashing functions into an s-tuples called a sketch depending on the spatial context. We use the bag-of-words technology to represent an image in a spatial pyramid way, and generate a minimal hashing function for each spatial location of the corresponding level. These minimal hashing functions are bundled to form a sketch. Furthermore, we implement the proposed algorithm to similar image searching. We use the binary SIFT combined with Hamming distance to verify the candidate images obtained by the spatial min-Hash in order to improve the retrieval performance. There are two advantages of our method: 1) the spatial min-Hash is more discriminative than the standard min-Hash in term of image representation; 2) the feature matching based on the binary SIFT in the verification stage improves the performance of image retrieval with a low computational cost. We implement our method on Oxford building dataset, and the experimental results demonstrate that the spatial min-Hash is a stronger representation method than the standard min-Hash, and the spatial min-Hash is superior to the standard min-Hash in term of retrieval performance. ? 2013 ACM.
语种	英语
出处	http://dx.doi.org/10.1145/2499788.2499863
出版者	Association for Computing Machinery
内容类型	其他
源URL	[http://dspace.xmu.edu.cn/handle/2288/86646]
专题	信息技术－会议论文
推荐引用方式 GB/T 7714	Qu, Yanyun,Song, Shuyang,Yang, Jiangjun,et al. Spatial min-Hash for similar image search. 2013-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。