外文翻译--基于批处理灰度图像的拼接方法COM组件技术.docx_第1页
外文翻译--基于批处理灰度图像的拼接方法COM组件技术.docx_第2页
外文翻译--基于批处理灰度图像的拼接方法COM组件技术.docx_第3页
外文翻译--基于批处理灰度图像的拼接方法COM组件技术.docx_第4页
外文翻译--基于批处理灰度图像的拼接方法COM组件技术.docx_第5页
已阅读5页,还剩2页未读 继续免费阅读

下载本文档

版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领

文档简介

附录B 引用外文文献及其译文COM component technology based batch gray images mosaic methodAbstractIn this paper, we present a gray image mosaic component design method based on the vector rotating relax matching algorithm, which can handle batch images fast and with high quality. We compute the coordinate transformation matrix for full-scene image splicing by using the image matching algorithm. The algorithms matrix operation implementation is based on the COM component technology toolbox in Matlab 7.0. We apply both fuzzy human visual restriction conditions for splicing images and the multithread technology in the VC development environment to improve the matching algorithm performance efficiency. The experiment part demonstrates the execution efficiency of the proposed method, which shows that it can meet the real-time demand of the batch gray image mosaic software system.Keywords: image mosaic; image registration; relaxation matching.1. IntroductionFull scene image software based on image splicing attracts great attention recently, such as Arc Soft Panorama Maker, Photoshop 8.0 etc. This software are often used to process image captured by the commercial camera or personal camera, which has high image quality. However, that software is not suitable for the camera which is often used in high speed mode, complex and harsh shooting conditions, such as industrial cameras. The image quality and image fidelity captured by industrial cameras are not as good as those captured by the personal camera or commercial camera, which more or less have different degrees of image distortion and reduce theaccuracy and stability of the automatic image mosaic algorithm(Liu, 2007).Because the main difficulty of image splicing lies on image registration, researchers put great attention on image registration technology in the past decades, and have achieved significant research results (Kanazawa & Kanatani, 2004; Miranda-Luna, Daul, Blondel, Hernandez-Mier, Wolf and Guillemin, 2008; Zitov & Flusser, 2003). To improve the image registration accuracy, a large sum of matrix operations are performed on the images, which is high computation cost, and reduces the efficiency of the image splicing software. This cannot Hence, these algorithms cannot extend to the realistic applications.Image registration algorithm based on vector rotating relax has been proven to be a precise and robust image matching algorithm (Wang, Hou, Cong, and Sun, 2010). However, in order to pursue the above two characteristics, this kind algorithm also involve many matrix operations, and the execution efficiency is not high. To overcome this bottleneck, in this paper, we proposed a method that uses multithread technology to optimize the image registration matrix, and to execute concurrently, which can meet the real-time demanding of the image registration system.2. Related Theories2.1. Relax matching algorithm based on the vector rotatingWang, Hou, Cong, and Sun (2010) proposed the relax matching algorithm based on the vector rotating, and the main idea is as follows: First, evaluate the two pairs of initial matching corner points extracted from two images; Second, involve another pair of corner points, and if the vector rotation angles of the this pair corners and that of the initial pairs of corners are very similar, support degree of this pair corner points and the two initial pairs of corner points is high. If the sum the support degree of pairs of corner points, which are constituted by one corner point with all other points, this corner point is wrong, and we can delete it. We repeat this process until all selected corner points meet the above conditions.2.2. Fuzzy human visual restriction conditionsWe can extract three main visual restriction conditions for the images to be spliced, from the vector rotating relax matching algorithm.1. Proportional band of the overlap parts between images2. The similarity of the grey level or the threshold between the images.3. Subjective visual image distortion degree of the images.Because of the differences between the images in the real world, the above three conditions in the real image process project cannot be consistent exactly, although we can get approximate values based on analysis of plenty of image data. However, this strategy will reduce the execution efficiency of the system, which is not suitable for the real world applications. On this other hand, in many industrial conditions, there is some certain pattern for the image sequences selected. For this kind of image sequences, the above three condition are usually applicable.2.3. Software designation for the fast image registrationThe image registration algorithm in Sec. 2.1 contains three main steps: Firstly, extract Harris corner point matrix for the two images to be spliced; secondly, initial circular projection matching; thirdly, relax optimization matching. The computing process of the three steps is corresponding to the above three conditions. Hence, we can improve the execution efficiency of the algorithm and the robustness of the system by reasonably using these fuzzy visual restriction conditions.The flowchart of the image registration algorithm proposed in Sec. 2.1 is shown in Fig.1 (a). We can see from Fig.1 (a) that, there is no relevance between Step 1 and Step 2, and every individual extraction is based on the whole image. This will produce plenty of useless corner points, which are a waste of time and will cause interference for the initial matching. For the corner point matrixes selected from Step 3 and Step 5, there is relevance, but there is no relevance for the corner points within the matrix. Hence, the computation of grey similarity of the corner points and that of the support degree summation of the optimization selection algorithm can be executed concurrently.Fig.1 (a) Flowchart of the image registration algorithm; (b) Software implementation of the image registration algorithmThe flowchart of the software for the image registration proposed in Sec. 2.1 is shown in Fig.1 (b). Fig.1 (b) shows that, the computation time of Step 1 and Step 2 can be overlap, and the corner points searching from the un-overlap area can be avoided based on the restriction condition 1, which can improve the efficiency of the feature points searching algorithm, and the accuracy of the initial matching. Step 3 divides the corner point matrix got from Step 1 based on columns of the matrix. In this paper, we divide it into 4 blocks based on the height of the simulation image (12801024). All the corner point matrix blocks compute the grey similarity concurrently, and select the initial corner point matching pairs based on the restriction condition 2. Step 6 clones the initial matching pair position coordinate set of the first image to be spliced got from Step 5 set into 4, and each set will be relax matching optimization selected based on the following strategy.Let the elements of the set be n, and the elements of the set x (x=1, 2, 3), the initial matching pairs position coordinates of which need to be selected based relax matching optimization algorithm, belong to the region: (x-1)n/4-n/4x, and that of the set 4 belongs to 3n/4-n.Through this way, each set just needs to keep one best corner points matching pair, and also, in the next image splicing step, the corner point matching pairs of SVD coordinate transformation can cover the whole image in the image space. In addition, this method can guarantee the coordinate transformation of image splicing matrix to be accurate. Based on the restriction condition 3, users can set the image distortion tolerance degree values themselves through fuzzy visual feelings, which can improve the robustness of the system significantly.3. Simulation ResultsIn this paper, the pair of images to splice is randomly selected from the Heilongjiang Province highway concrete pavement splicing samples. These samples are captured by an automatic road detection vehicle, which runs at the speed of 70km/h. This size of the image is 12801024. Concrete pavement for reference is shown in Fig. 2 (a), and concrete pavement to be registered is shown in Fig. 2 (b).Fig.2 (a) Concrete pavement for reference; (b) Concrete pavement to be registeredFrom table 1 we can see that, under the above experimental settings, the proposed algorithm can finish the image registration in about an average 20s, which is acceptable for the customers. Another convincing point is that the multithread technology can make full use of the CUP resource. As the multi core CUP is on a daily broadening scale, multithread technology which executes data operation concurrently will be the trend. The execution efficiency of the image splicing algorithm based on multithread technology will continue to improve as the continuous upgrade of CUP technology.4. ConclusionIn this paper, we proposed a COM component design method for a multithread based image splicing algorithm. This method increases the stability of the splicing system by involving fuzzy visual restriction conditions and, in some degrees, optimizes the algorithm structure and increases the execution efficiency of the algorithm. The proposed method is valuable to promote for real industrial full-scene image splicing.基于批处理灰度图像的拼接方法COM组件技术摘要在本文中,我们提出了一种以矢量旋转的松弛匹配算法为根据的灰度图像拼接构件设计方法,可以快速地、高效地处理批处理图像。我们利用图像匹配算法来计算全景图像拼接的坐标变换矩阵。该算法的矩阵运算的实现是基于Matlab 7 当中的COM组件技术工具箱。我们应用模糊的视觉限制条件进行拼接图像,在VC开发环境下利用多线程技术提高匹配算法的效率。实验完全证实了所提出方法的执行效率,表明它能满足批量的灰度图像拼接软件系统实时性的要求。关键词:图像拼接;图像配准;松弛匹配。1.引言近年来,基于图像拼接的全景图像软件受到了极大的关注,如虹软全景图像拼接大师、PS图像处理软件 8.0 等。这些软件经常被用来处理具有高质量的商业相机或个人相机拍摄的图像。然而,这些软件并不适合经常用于高速模式、复杂和恶劣的拍摄条件的相机,如工业相机。由工业摄像机拍摄的图像质量和图像保真度没有那些由个人或商业相机拍摄的那样好,这或多或少会降低图像自动拼接的准确性和稳定性。由于图像拼接的主要困难是图像配准,因此在过去的几十年,研究者特别重视图像配准技术,并取得了显著的研究成果。为了提高图像配准的精度,大量的矩阵运算应用于图像,这需要很高的计算成本,降低了图像拼接软件的效率。还不仅如此,这些算法不能扩展到现实中。基于矢量旋转的松弛的图像配准算法已被证明是准确和鲁棒性的图像匹配算法。然而,为了追求上述两个特点,这种算法还涉及到很多的矩阵运算,且执行效率不高。为了克服这一瓶颈,在本文中,我们提出了一种利用多线程技术来优化图像配准矩阵的方法,可以满足图像配准系统的实时性的要求。2.相关理论2.1 基于矢量旋转的松弛匹配算法Wang,Hou,Cong and Sun提出了基于矢量旋转的松弛匹配算法,其主要思想是:首先,评价两组从两幅图像中提取的初始角点;第二,如果这两组角点的向量旋转角度非常相似,那么这两组角点的相似度就很高。如果这对角点和其他角点都相似,那这个点就是错误的,我们可以删除它。我们重复这个过程,知道所选定的角点都满足上述条件。2.2 模糊的视觉限制条件我们可以从矢量旋转松弛匹配算法中为待拼接图像提取三个主要视觉限制条件。1. 图像之间的重叠部分的比例带。2. 图像之间的阀值和灰度级的相似度。3. 图像的主观视觉图像的失真度。虽然我们可以通过大量的图像数据的分析获得近似值,但因在现实世界图像之间的差异,在实际的图像处理中,上面三个条件不能够准确一致。然而,这种策略会降低系统的执行效率,这是不适合在现实世界中应用的。在另一方面,在许多工业的情况下,可以选择一些

温馨提示

  • 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
  • 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
  • 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
  • 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
  • 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
  • 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
  • 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

评论

0/150

提交评论