2014 · 173 citations · 21 references
ComputingComputer ScienceComputer VisionDigital ImagingMachine Vision3D ReconstructionHash FunctionsHash TablesImage ReconstructionAccuracyAccuracy-computational Cost TradeoffBrute-force SearchHashingImage MatchingMatching
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.
21
Adhi Harmoko S, M.Komp, Joseph Marie Jacquard et al. · 2005 · 18.4K citations
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
Speeded-Up Robust Features (SURF)
Herbert Bay, Andreas Ess, Tinne Tuytelaars et al. · Computer Vision and Image Understanding · 2008 · 13.4K citations