一种全景图快速生成算法及其实现

针对柱面全景图拼接提出一种快速稳定的拼接算法。该方法将待拼接的二维图像的灰度值投影变换到一维数轴上，选择特征明显的灰度段作为模板，通过序贯相似性检测进行匹配，并在匹配过程中能够自适应地调整阀值，最后采用线性加权法对图像进行无缝拼接。采用普通相机拍摄的序列图像进行实验，实验结果证明该方法提高了拼接速度，降低了图像亮度差异的影响，使结果图像自然逼真。     

一种鲁棒的序列图像自动拼接方法

针对传统图像拼接方法中鲁棒性差、计算量大及自动化程度低等问题,提出一种鲁棒性高的序列图像自动拼接方法。该方法首先采用Harris角点检测算子对经Wallis滤波后的序列图像进行特征点提取,并结合Forstner算子对特征点进行精确定位。然后基于所提取的特征点,采用邻域灰度互相关法进行序列图像的特征点匹配,得到粗匹配点集,并运用RANSAC算法对粗匹配点集处理得到精匹配点集,由精匹配点集求出较高精度的基础矩阵及极线,并由极线约束引导匹配得到高精度的匹配点对,再运用双向松弛整体匹配算法进一步剔除少数位于极线上的误匹配点。最后利用所得的高精度匹配点对,求解序列图像间的仿射变换关系,并进行图像的坐标变换和融合,从而实现序列图像的自动拼接。实验结果表明,该方法拼接效果理想,鲁棒性高,整个拼接过程全自动,不需要人工干预,具有较高的实用价值。     

一种改进的降低扭曲误差的快速图像拼接算法

通过提取SIFT特征进行图像拼接得到的全景图存在一定程度的扭曲误差,尤其当序列图像集合很大时,全景图扭曲现象更为严重。为提高全景图拼接质量,对Song Fuhua等人提出的图像拼接算法进行改进,首先改变参考图像的选取方式,提出图像序列中任意图像映射到与参考图像相同坐标系下的变换模型计算方法,并且在拼接过程中根据匹配特征点数目动态选取下次待拼接图像。与Song Fuhua等人提出的拼接算法相比,改进的图像拼接算法增加了图像重叠区域中SIFT特征点匹配对数,减小了参考图像SIFT特征检测区域。实验表明,提出的改进拼接算法提高了全景图拼接的时间效率,同时全景图扭曲现象也得到极大改善。     

一种光照鲁棒的图像拼接融合算法

针对传统图像拼接方法只能处理光照一致图像的问题,提出了一种对环境光照鲁棒的全景图拼接算法。该算法首先使用圆环投影来获取待拼接图像的匹配特征序列,不仅克服了传统图像特征提取方法中的区域局限性问题,而且较好地实现了光照变化的图像匹配;然后使用统计参数来调整待拼接图像的整体亮度,以解决光照变化问题;最后对于传统图像融合处理中采用线性加权函数通常引起的最终拼合图像重叠区域模糊问题,构造了包含图像梯度的能量函数,用于计算重叠区域的全局最优融合因子。实验表明,该算法对光照变化图像的拼接融合能取得满意的视觉效果。     

基于SURF的序列图像快速拼接方法

针对车载摄像平台的序列图像拼接问题,提出一种基于SURF的序列图像快速拼接方法.首先,对经预处理后的序列图像提取SURF特征点,采用最近邻法匹配特征点;其次,利用RANSAC算法估计相邻帧的变换关系;再采用改进的全局配准策略,完成图像配准;最后,采用一种最大值融合法,去除了拼接缝和光照明暗变化的影响,实现序列图像的无缝拼接.实验结果表明该方法适用于车载摄像平台序列图像的快速、无缝拼接,具有较强的鲁棒性,有一定的实用价值.     

一种基于特征点的稳健无缝图像拼接算法

针对传统的基于区域图像拼接方法中,计算量大、鲁棒性差以及不能很好地解决拼接后的接缝等问题,提出了一种稳健的基于特征点的无缝图像拼接算法.在SIFt(scale invariant feature transform)提取图像特征点并匹配的基础上,通过优化的随机采样一致性(random sample consensus)算法过滤匹配点,去除误匹配点,并用过滤后的匹配点求解两对应图像间单应性矩阵初值;然后利用L-M算法优化单应性矩阵对图像序列进行拼接;最后通过改进线性加权函数法进行图像融合,很好地解决了接缝问题,实现了图像拼接处的平滑过渡.实验表明,该方法对存在旋转、尺度缩放、视角以及光照变化的图像都具有良好的拼接效果,拼接精度可以达到亚像素级.     

仿射不变轮廓匹配的视频拼接研究

为了解决复杂场景变换时视频拼接的精度问题,提出了一种仿射不变轮廓匹配的拼接算法——利用场景中主要区域的轮廓信息对视频图像进行匹配,然后利用匹配点求解运动参数进行拼接。该方法克服了传统拼接算法在复杂的场景变化以及重叠区小的情况下拼接精度低的问题。与基于SIFT的拼接算法对比表明,该算法实现了图像序列的高精度拼接,不仅能适应仿射变换,并且对于重叠区域小,存在运动遮挡的视频具有一定的鲁棒性。     

序列图像拼接过程中误匹配的消除

序列图像拼接过程中困难之一是当重叠区域内存在多个相似部分时,就会发生误区配而导致拼接失败。在采用图像特征区域配准算法中,基于同名区域面积差、区域重心同位、区域重心距离比及配准参数复用提出了四种误区配的消除方法。实验表明,这些方法能有效地消除误匹配,提高序列图像拼接的配准率。     

基于最佳缝合线的序列遥感图像拼接融合方法

在图像融合过程中常采用重叠区域像素加权融合方法,这会存在鬼影现象。为解决这一问题,提出了一种改进的最佳缝合线生成算法和沿最佳缝合线的融合方法,并将其应用于序列遥感图像的拼接融合。首先在重叠图像中,对重叠区域的边赋予权值,然后进行最大流最小割,最终获取最佳缝合线。在计算边权值时引入了图像梯度信息,使缝合线更准确。在图像融合时,沿最佳缝合线生成一个条带形融合区域,采用渐入渐出法对缝合线两侧的条带形融合区域图像进行过渡处理,使拼接后的图像更为真实。在序列遥感图像拼接上,采用捆绑调整算法调整拼接图像的参数来实现全局误差最小化。实验表明,该方法能够有效消除鬼影并且能获得准确的拼接图像与融合,对于序列遥感图像的拼接融合能够获得很好的效果。     

运用区域标定自动机的文字图像拼接算法

本文提出了一种新的文字图像的匹配拼接算法。运用基于区域标定自动机的方法获得重叠图像的特征匹配点,利用特征点的匹配可成功实现倾斜的灰度文字图像及无倾斜二值文字图像的平滑拼接。实践结果表明,方法拼接效果良好,能有效地克服图像质量的影响,当灰度图像的灰度值相差较大并且图像具有旋转时,也能实现对图像的拼接。     

交互式眼底图像拼接的研究与实现

眼底照相机获取的人眼眼底图像,可以辅助医生对眼底或相关疾病进行诊断。现有眼底相机只能获取局部眼底图像,而全景眼底图像的信息更为有效、全面,可降低医生误诊率。虽然眼底图像自动拼接精度高,人工干预少,但限制因素较多尚不完善。本文提出一种交互式眼底图像拼接方法,并对具有重叠区域的眼底图像在配准时引入模板匹配法提高精度,在VC++编译环境中实现,拼接结果保留了各子图的细节信息,融合接缝区域,是有效的眼底全景图像,并可为眼底图像后续处理提供支持。     

A new approach to real-time mosaicing of aerial images

We present a new image mosaicing technique that uses sequential aerial images captured from a camera and is capable of creating consistent large scale mosaics in real-time. To find the alignment of every new image, we use all the available images in the mosaic that have intersection with the new image instead of using only the previous one. To detect image intersections in an efficient manner, we utilize ‘Separating Axis Theorem’, a geometric tool from computer graphics which is used for collision detection. Moreover, after a certain number of images are added to the mosaic, a novel affine refinement procedure is carried out to increase global consistency. Finally, gain compensation and multi-band blending are optionally used as offline steps to compensate for photometric defects and seams caused by misregistrations. Proposed approach is tested on some public datasets and it is compared with two state-of-the-art algorithms. Results are promising and show the potential of our algorithm in various practical scenarios.     

无有效重叠区域的SAR图像拼接方法

机载SAR雷达在成像时,由于受各种随机噪声因素的影响,在其所生成的相邻图像帧间存在小的重叠、断裂或者错位,因此常常不能提取出满足独特性要求的特征子图像.针对此类SAR图像序列的拼接,给出了一种新的无有效重叠区域的SAR图像拼接方法.该方法先利用图像特定点地理坐标以及载机航迹角进行粗拼接;然后提取邻接处附近的显著线状特征,同时对这些特征进行较精确的匹配定位;最后对拼接处的像素灰度进行融合,以避免出现明显的接缝.实验结果表明,新方法在进行无有效重叠区域的SAR图像拼接时,取得了较好的拼接效果.     

A fast mosaic method for airborne images: the new Template-Convolution Speed-Up Robust Features (TSURF) algorithm

In this paper, we present a new feature extraction algorithm termed Template-Convolution Speed-Up Robust Features (TSURF), which uses template convolution to extract points of interest based on the Speed-Up Robust Features (SURF) algorithm. Feature extraction is applied to extract corresponding characteristics in overlapping fields from adjacent images. The characteristics include area, line, and point features. As the point feature is easy to compute and is invariant to image scale, rotation, intensity, and so on, we use it to register and mosaic images widely. By filtering redundant points of interest, TSURF can greatly reduce the running time and keep the mosaic quality good during real-time mosaicking. SURF and TSURF are applied to airborne images to compare the efficiency of each algorithm in constructing a mosaic. We calculate the average coordinate error and angle error for evaluating mosaic precision. We also use the average gradient, standard deviation, and forecast root mean-square error to compare the mosaic quality of SURF with that of TSURF. The first mosaic experiment consisting of 20 groups of airborne images showed that the mosaic speed of TSURF is three times faster than that of SURF and maintains comparative mosaic accuracy. In the second experiment, a series of continuous thumbnail images were mosaicked using the SURF and TSURF algorithms fully automatically. The TSURF speed was 63.40% faster than that of SURF and the accuracy remained consistent.     

改进的全景图拼接融合算法

在全景图像理论的基础上,对现有的拼接算法进行研究和改进,采用基于像素点颜色变化特征和序列相似性检测拼接算法相结合的图像拼接融合方法对柱面全景图进行拼接。实验表明,与原有的算法相比,采用改进后算法的全景图拼接效果得到了改进,对柱面全景图像的拼接融合能取得满意的视觉效果。     

A virtual reality system using the concentric mosaic: construction, rendering, and data compression

This paper proposes a new image-based rendering (IBR) technique called "concentric mosaic" for virtual reality applications. IBR using the plenoptic function is an efficient technique for rendering new views of a scene from a collection of sample images previously captured. It provides much better image quality and lower computational requirement for rendering than conventional three-dimensional (3-D) model-building approaches. The concentric mosaic is a 3-D plenoptic function with viewpoints constrained on a plane. Compared with other more sophisticated four-dimensional plenoptic functions such as the light field and the lumigraph, the file size of a concentric mosaic is much smaller. In contrast to a panorama, the concentric mosaic allows users to move freely in a circular region and observe significant parallax and lighting changes without recovering the geometric and photometric scene models. The rendering of concentric mosaics is very efficient, and involves the reordering and interpolating of previously captured slit images in the concentric mosaic. It typically consists of hundreds of high-resolution images which consume a significant amount of storage and bandwidth for transmission. An MPEG-like compression algorithm is therefore proposed in this paper taking into account the access patterns and redundancy of the mosaic images. The compression algorithms of two equivalent representations of the concentric mosaic, namely the multiperspective panoramas and the normal setup sequence, are investigated. A multiresolution representation of concentric mosaics using a nonlinear filter bank is also proposed.     

Parallel line integral convolution

Line integral convolution (LIC) is a powerful method for computing directional textures from vector data. LIC textures can be animated, yielding the effect of flowing motion. Both, static images and animation sequences are of great significance in scientific visualization. Although an efficient algorithm for computing static LIC textures is known, the generation of animation sequences still requires a considerable amount of computing time. In this paper we propose an algorithm for computing animation sequences on a massively parallel distributed memory computer. With this technique it becomes possible to utilise animated LIC for interactive vector field visualization. To take advantage of the strong temporal coherence between different frames, parallelization is performed in image space rather than in time. Image space coherence is exploited using a flexible update and communication scheme. In addition algorithmic improvements on LIC are proposed that can be applied to parallel and sequential algorithms as well.     

一种新的基于特征区域的图像配准算法

全景拼图是近年来兴起的基于图像的绘制技术(IBR)中的一个重要研究方向。在全景视图的实现过程中,关键技术是实现重叠图像正确、平滑的无缝拼接。本文在原有图像配准技术的基础上,提出了一种新的基于特征区域的配准算法,该算法利用两幅重叠图像对应特征区域的相似性,经过特征选择、特征提取和特征匹配三个阶段,实现两幅图像的拼接。实验结果证明,该算法在拼接速度和效果方面的表现均令人满意。     

图像拼接的改进算法

图像拼接在制作全景图的过程中具有重要作用，但是现有的方法不能很好地处理鬼影和曝光差异，针对存在的问题，提出了一种实现图像拼接的算法．首先利用动态规划的方法在要进行拼接的图像中找到一条最佳的缝合线，然后利用多分辨率技术进行拼接，解决了鬼影和曝光差异。     

Parallel border tracking in binary images using GPUs

The Journal of Supercomputing - Border tracking in binary images is an important kernel for many applications. There are very efficient sequential algorithms, most notably, the algorithm proposed...