中文摘要：

在不丢失非重叠区域数据的情况下,对多视拼接重合区域的三维点云数据进行消冗处理是三维拼接中的一个难题。针对这一难题,提出了一种结合二维图像信息查找和消除冗余数据的新方法。算法首先查找位于拼接重叠区域的三维点云数据,结合三维点的K近邻约束和对应像素特征描述的相似度,对重叠区域的点云数据进行冗余查找和消除。实验表明,该方法能够准确判断并消除冗余点,没有造成更改或丢失非重叠区域三维数据点的不良效果,消冗速度也有所提高。

英文摘要：

It is a difficult problem to make a redundancy processing for 3D point of overlapping areas after multi-view registration without any loss of data of non-overlapping areas.For this problem,this paper put forward a new algorithm,which found and eliminated the redundant data of overlapping areas combined with 2D image information.Firstly,it found the 3D point located in overlapping areas.Then it found and eliminated the redundant point of overlapping areas based on the constraints of K-nearest neighbors and the similarity of descriptors of corresponding pixels.Experimental results show that,the proposed method can estimate and eliminate the redundant point accurately,does not bring about any changing or lossing to the 3D point of non-overlapping areas,the speed is also increased.