In view of the fact that the SIFT algorithm extracts the feature points too little and ignores their distribution
and also has the problem of high computation cost
a discrete-scale-invariant feature extraction algorithm(discrete SIFT or DSIFT in short)is proposed. This algorithm introduces a sliding window on the space extreme test phase of the SIFT algorithm
implements non-maximum suppression for the extreme points detection inside the window
so that the feature points are distributed relatively even. In addition
this algorithm makes the calculation faster
and at the same time maintains the scale
rotation
and affinity invariant. In order to reduce the time overhead of the image registration in various stages
it adds a desampling operation before feature extraction and the operation of location information reversion before calculating the homographic matrix. And it also introduces K-Dimensional Tree in the process of searching matching points
and adopts RANSAC algorithm in the shifting of the feature points and estimation of homographic matrix. Finally
through experiment verification
it is found that the DSIFT algorithm has more uniform distribution of feature points than SIFT algorithm
and with high robustness. At the same time
on the premise of guaranteeing the quality of image mosaicking
the time overhead in various stages of image registration is greatly reduced.
关键词
Keywords
references
SZELISKI R. Image alignment and stitching: a tutorial [J]. Foundations and Trends in Computer Graphics and Vision, 2006, 2(1): 1-104.
SZELISKI R, SHUM H Y. Creating full view panoramic image mosaics and environment maps [C]∥Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques. New York, USA: ACM, 1997: 251-258.
PELEG S, ROUSSO B, RAV-ACHA A, et al. Mosaicing on adaptive manifolds [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000, 22(10): 1144-1154.
CHEN Fang, ZHOU Yifang, ZHAO Binwen, et al. Novel algorithm for image mosaic using linear texture match [C]∥International Conference on Electronic Measurement Instruments. Piscataway, NJ, USA: IEEE, 2011: 119-122.
BROWN M, LOWE D G. Automatic panoramic image stitching using invariant features [J]. International Journal of Computer Vision, 2007, 74(1): 59-73.
MAHESH, SUBRAMANYAM M V. Automatic image mosaic system using steerable Harris corner detector [C]∥Machine Vision and Image Processing. Piscataway, NJ, USA: IEEE, 2012: 87-91.
HUA Liqin, XU Wei, WANG Tuo, et al. Vehicle recognition using improved sift and multi-view model [J]. Journal of Xi'an Jiaotong University, 2013, 47(4): 92-99.
LOWE D G. Distinctive image features from scale-invariant keypoints [J]. International Journal of Computer Vision, 2004, 60(2): 91-110.
ABDEL-HAKIM A E, FARAG A A. A SIFT descriptor with color invariant characteristics [C]∥IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Piscataway, NJ, USA: IEEE, 2006: 1978-1983.
BAY H, TUYTELAARS T, GOOL L V. Speeded up robust features [C]∥ Computer Vision-ECCV. Berlin, Germany: Springer, 2006: 404-417.
HARRIS C, STEPHENS M. A combined corner and edge detector [C]∥Proceedings of the 4th Alvey Vision Conference. Piscataway, NJ, USA: IEEE, 1988: 147-151.
SMITH S M, BRADY J M. SUSAN: a new approach to low level image processing [J]. International Journal of Computer Vision, 1997, 23(1): 45-78.
ROSTEN E, DRUMMOND T. Machine learning for high-speed corner detection [C]∥ Computer Vision-ECCV. Berlin, Germany: Springer, 2006: 430-443.
LUO Juan, GWUN O. A comparison of SIFT, PCA-SIFT and SURF [J]. International Journal of Image Processing, 2009, 3(4): 143-152.