Laser & Optoelectronics Progress, Volume. 55, Issue 3, 031005(2018)

Fast Image Mosaic Algorithm Based on Area Blocking and BRISK

Ting Zhao, Hailin Kang, and Zhengping Zhang*
Author Affiliations
  • College of Big Data and Information Engineering, Guizhou University, Guiyang, Guizhou 550025, China
  • show less

    In order to solve the problems of the low matching rate and the low mosaic efficiency of the traditional image mosaic algorithms, we propose a fast image mosaic algorithm based on area blocking and binary robust invariant scalable keypoints (BRISK). Firstly, we use the frequency domain phase correlation algorithm to find the similar areas between the two images. Secondly, we divide the similar areas into N×N' image blocks evenly and calculate the standard deviation of each image block. Thirdly, selecting two image blocks with large standard deviations in different positions, we coarsely match the feature points by BRISK algorithm. Fourthly, we construct the directed line segments and match the adjacent line segments after obtaining the matching points. Finally, we calculate the projection transformation matrix by the randomly matching point pairs to correct the projection error, and accomplish the image mosaic by weighted fusion and luminance equalization. The experimental results show that the matching correctness of the proposed algorithm is more than 90%, and the mosaic speed is increased by 63.7%.

    Tools

    Get Citation

    Copy Citation Text

    Ting Zhao, Hailin Kang, Zhengping Zhang. Fast Image Mosaic Algorithm Based on Area Blocking and BRISK[J]. Laser & Optoelectronics Progress, 2018, 55(3): 031005

    Download Citation

    EndNote(RIS)BibTexPlain Text
    Save article for my favorites
    Paper Information

    Category: Image processing

    Received: Sep. 22, 2017

    Accepted: --

    Published Online: Sep. 10, 2018

    The Author Email: Zhang Zhengping (zpzhang@gzu.edu.cn)

    DOI:10.3788/LOP55.031005

    Topics