Abstract

Speeded up robust features (SURF) algorithm is widely used because of its excellent computational efficiency and robustness in the field of image matching and image stitching. In this paper, we propose an adaptive uniform distribution SURF algorithm for image stitching. The proposed SURF algorithm will adaptively select the appropriate uniform distribution radius which is depending on image complexity and utilize this radius to wipe off amounts of unnecessary interest points. The remaining interest points will be distributed well in the image and much less than the number of interest points detected by the original SURF, which will result in reducing the computation complexity of subsequent SURF procedure significantly. Experimental results show that our proposed method is able to shorten the processing time distinctly without loss of matching precision.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.