一种适用于图像拼接的DSIFT算法研究

周远; 周玉生; 刘权; 杨新宇

doi:10.7652/xjtuxb201509015

您当前的位置：

首页 >

文章列表页 >

一种适用于图像拼接的DSIFT算法研究

更新时间：2025-07-09

- 一种适用于图像拼接的DSIFT算法研究
- Research on a DSIFT Algorithm Applicable to Image Mosaicking
- 西安交通大学学报 2015年49卷第9期页码：84-90
- 作者机构：
  
  西安交通大学电子与信息工程学院,西安,710049
- 作者简介：
- 基金信息：
- DOI：10.7652/xjtuxb201509015
  中图分类号： TP391
- 网络首发：2015-09-10，
  
  纸质出版：2015
- 稿件说明：
移动端阅览
周远, 周玉生, 刘权, 等. 一种适用于图像拼接的DSIFT算法研究[J]. 西安交通大学学报, 2015,49(9):84-90.

Research on a DSIFT Algorithm Applicable to Image Mosaicking[J]. 2015, 49(9): 84-90.
周远, 周玉生, 刘权, 等. 一种适用于图像拼接的DSIFT算法研究[J]. 西安交通大学学报, 2015,49(9):84-90. DOI： 10.7652/xjtuxb201509015.

Research on a DSIFT Algorithm Applicable to Image Mosaicking[J]. 2015, 49(9): 84-90. DOI： 10.7652/xjtuxb201509015.

摘要

针对SIFT算法在分辨率很低的模糊边缘平滑图像中提取的特征点数量过少

而且没有考虑特征点的分布情况、计算开销较大的问题

提出了一种离散尺度不变特征提取DSIFT(Discrete SIFT)算法。该算法在空间极值检测阶段引入一个滑动窗口

在窗口内对极值点的检测进行非极大值抑制

使得特征点的分布相对均匀

运算速度更快

并且保持了尺度、旋转、仿射等不变性。在特征提取前添加了降采样操作

在计算单应矩阵前添加位置信息还原的步骤

在查找匹配点的过程中引入K-D树

以及在特征点的筛选和单应矩阵的估计上采用RANSAC算法

都降低了图像配准各个阶段的时间开销。最后

通过实验验证

DSFIT算法相对SIFT算法具有更加均匀的特征点分布

保持了较高的鲁棒性

同时

在保证一定图像拼接质量的前提下极大地降低了图像配准各个阶段的时间开销。

Abstract

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.

华莉琴, 许维, 王拓, 等, 采用改进的尺度不变特征及多视角模型对车型识别 [J]. 西安交通大学学报, 2013, 47(4): 92-99.

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.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于模板匹配的图像配准算法

基于特征层和二代曲波变换的多模生物特征融合识别方法

采用小世界免疫克隆算子的频率域图像配准

基于区域特性的Contourlet域多聚焦图像融合算法

结合对比度塔和克隆选择加权Wedgelets的图像融合