Aiming at the problem that the SIFT algorithm does not fully consider the distribution of feature points in the image splicing and the calculation is complex and takes a long time
an improved PCA-SIFT algorithm is proposed. The algorithm firstly introduces an improved non-maximum suppression method to optimize the initial feature points so as to obtain a more even distribution of feature point sets. Then the 64-dimension SIFT descriptor is extracted based on the circular neighborhood
and the descriptor is further reduced using PCA to reduce the data complexity of the descriptor. Finally
the BBF search strategy based on K-D tree was introduced. The RANSAC was used to eliminate the false matching points
which improved the matching speed and matching accuracy. In the 10 sets of image stitching experiments
the stitching speed of this algorithm is 1.6~2.2 times that of the traditional SIFT algorithm. Experimental results show that the proposed algorithm has higher accuracy
better robustness
and stronger real-time performance.
关键词
Keywords
references
Mikolajczyk K, Schmid C. A performance evaluation of local descriptors[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2005, 27(10): 1615-1630. DOI: 1615
Luan H, Law N F. A novel dual-threshold SIFT-based copy-move forgery detection[C]// Signal and Information Processing Association Summit and Conference. Kuala Lumpur, Malaysia, IEEE, 2017: 1-5.
Dong Q, Liu J. Seamline determination based on PKGC segmentation for remote sensing image mosaicking[J]. Sensors, 2017, 17(8):1721. DOI: 1721
Lowe D G. Distinctive image features from scale invariant key points[J]. International Journal of Computer Vision, 2004, 60(2): 91-110. DOI: 91
Yu Qing H E, Xue W, Wang S Y, et al. Modified SIFT descriptor and key-point matching for fast and robust image mosaic[J].北京理工大学学报(英文版), 2016, 25(4):562-570. DOI: 562