一种快速的柱面全景图像拼接算法

基于等距离匹配思想，提出一种快速的柱面全景图像拼接算法。对于相邻两幅待匹配图像，设定相同大小的比较区域，从两幅图像中心垂线开始向重叠方向同步长移动并进行比较。在比较区域中采取随机取点的方式，计算对应点的颜色差值并累加，若达到某一设定阈值，则停止计算，移动比较过程中，计算次数最多的比较区域中心位置即为最佳匹配位置。该算法可以尽早排除非匹配位置，减少计算量，提高全景图像生成速度。利用该算法思想对随机顺序输入的场景图像序列进行排序，可以获得按照实际场景内容排列的图像序列，然后进行全景图像匹配拼接，实验结果表明该算法快速有效。

Fast Algorithm for Cylindrical Panoramic Image Mosaic

Based on equidistant matching, a fast algorithm for cylindrical panoramic image mosaic is proposed. Firstly, the regions of the same size are chosen for comparison on two overlapping images. Then, the regions are moved to the edges in overlapping direction from the perpendicular centerlines of the images with the same step length respectively. Finally, the color differences of corresponding sampling pixels are chosen at random and are accumulated. Donot stop the calculating until the accumulated value reaches the threshold. The position with the most calculating time is the best mosaic location. The algorithm can exclude non-matching location as soon as possible, and decrease the matching time. The experiment proves that panoramic image mosaic with high quality can be quickly constructed by using the algorithm, the images to be mosaicked are put at random to obtain cylindrical panoramic image mosaic.