Fast and Accurate Image Matching with Cascade Hashing for 3D Reconstruction

CVPR(2014)

引用 189|浏览41
暂无评分
摘要
Image matching is one of the most challenging stages in 3D reconstruction, which usually occupies half of computational cost and inaccurate matching may lead to failure of reconstruction. Therefore, fast and accurate image matching is very crucial for 3D reconstruction. In this paper, we proposed a Cascade Hashing strategy to speed up the image matching. In order to accelerate the image matching, the proposed Cascade Hashing method is designed to be three-layer structure: hashing lookup, hashing remapping, and hashing ranking. Each layer adopts different measures and filtering strategies, which is demonstrated to be less sensitive to noise. Extensive experiments show that image matching can be accelerated by our approach in hundreds times than brute force matching, even achieves ten times or more than Kd-tree based matching while retaining comparable accuracy.
更多
查看译文
关键词
accurate image matching,hashing remapping,hashing lookup,image matching,computational cost,noise,cryptography,fast image matching,telecommunication network reliability,three-layer structure,kd-tree based matching,measuring strategy,cascade hashing method,image reconstruction,cascade networks,reconstruction failure,3d reconstruction,brute force matching,file organisation,inaccurate matching,filtering strategy,hashing ranking,binary codes,acceleration,time complexity,hamming distance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要