![]() Changes may have been made to this work since it was submitted for publication. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. N1 - This is the author’s version of a work that was accepted for publication in Pattern Recognition. T1 - Efficient large-scale oblique image matching based on cascade hashing and match data scheduling ![]() The experimental results show that our method can complete a match pair within 2.50∼2.64 ms, which not only is much faster than two open benchmark pipelines (i.e., OpenMVG and COLMAP) by 20.4∼97.0 times but also have higher efficiency than two state-of-the-art commercial software (i.e., Agisoft Metashape and Pix4Dmapper) by 10.4∼50.0 times.", Comprehensive experiments are conducted on three oblique image datasets to test the efficiency and effectiveness of the proposed method. Second, we adopt the epipolar constraint to filter the initial candidate points of cascade hashing matching, thereby significantly increasing the robustness of matching feature points. First, to reduce the number of redundant transmissions of match data, we propose a novel three-level buffer data scheduling (TLBDS) algorithm that considers the adjacency between images for match data scheduling from disk to graphics memory. Abstract = "In this paper, we design an efficient large-scale oblique image matching method.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |