CN112419164A - Curvature and neighborhood reconstruction-based weighted guide point cloud model denoising method - Google Patents
Curvature and neighborhood reconstruction-based weighted guide point cloud model denoising method Download PDFInfo
- Publication number
- CN112419164A CN112419164A CN201910783574.3A CN201910783574A CN112419164A CN 112419164 A CN112419164 A CN 112419164A CN 201910783574 A CN201910783574 A CN 201910783574A CN 112419164 A CN112419164 A CN 112419164A
- Authority
- CN
- China
- Prior art keywords
- neighborhood
- point
- points
- curvature
- cloud model
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000009466 transformation Effects 0.000 claims abstract description 37
- 238000001914 filtration Methods 0.000 claims description 17
- 230000000694 effects Effects 0.000 claims description 12
- 239000011159 matrix material Substances 0.000 claims description 4
- 239000013598 vector Substances 0.000 claims description 4
- 230000003247 decreasing effect Effects 0.000 claims 1
- 238000010586 diagram Methods 0.000 description 14
- 238000011156 evaluation Methods 0.000 description 3
- 238000012952 Resampling Methods 0.000 description 2
- 238000009499 grossing Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000003672 processing method Methods 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T5/00—Image enhancement or restoration
- G06T5/70—Denoising; Smoothing
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T2207/00—Indexing scheme for image analysis or image enhancement
- G06T2207/10—Image acquisition modality
- G06T2207/10028—Range image; Depth image; 3D point clouds
Landscapes
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Image Processing (AREA)
Abstract
本发明公开了一种基于曲率和邻域重构的加权引导点云模型去噪方法。该方法为:首先,计算点云模型中每个点的曲率信息,根据设定的阈值,将模型中的特征点提取出来;其次,根据提取出来的特征点,在由K近邻法获取的邻域的基础上重构邻域点,并使得重构出的邻域在一个面上;然后,根据重构出的邻域,利用每个点的三维位置信息作为引导信号,同时将曲率信息作为加权信号加入到位置引导信号中,从而对点云模型中的每个点做线性变换;最后,根据计算出的线性变换系数,对每个点进行线性变换,实现点云模型去噪。本发明在对点云去噪模型的同时保持了点云模型的特征信息,并且对于不同程度的噪声有较好的鲁棒性。
The invention discloses a weighted guidance point cloud model denoising method based on curvature and neighborhood reconstruction. The method is: first, calculate the curvature information of each point in the point cloud model, and extract the feature points in the model according to the set threshold; The neighborhood points are reconstructed on the basis of the domain, and the reconstructed neighborhood is on one surface; then, according to the reconstructed neighborhood, the three-dimensional position information of each point is used as a guiding signal, and the curvature information is used as a guide signal. The weighted signal is added to the position guidance signal, so that each point in the point cloud model is linearly transformed; finally, each point is linearly transformed according to the calculated linear transformation coefficient to achieve denoising of the point cloud model. The invention maintains the feature information of the point cloud model while denoising the point cloud model, and has better robustness to different degrees of noise.
Description
技术领域technical field
本发明涉及计算机图形学和三维点云去噪技术领域,特别是一种基于曲率和邻域重构的加权引导点云模型去噪方法。The invention relates to the technical field of computer graphics and three-dimensional point cloud denoising, in particular to a weighted guidance point cloud model denoising method based on curvature and neighborhood reconstruction.
背景技术Background technique
近年来,由于虚拟现实、增强现实等应用的出现和推广,点云模型处理技术成为计算机图形学研究领域的热点之一。去噪后的点云模型可以作为动画、渲染、三维重建等应用的基础。随着各种扫描设备,尤其是消费级深度传感器(如Kinect)的日益普及,鲁棒的点云去噪方法的设计变得越来越重要,而点云去噪的主要技术挑战在于如何在去除噪声的同时有效地保持模型的特征。In recent years, due to the emergence and promotion of applications such as virtual reality and augmented reality, point cloud model processing technology has become one of the hot spots in the field of computer graphics research. The denoised point cloud model can be used as the basis for applications such as animation, rendering, and 3D reconstruction. With the increasing popularity of various scanning devices, especially consumer-grade depth sensors such as Kinect, the design of robust point cloud denoising methods becomes more and more important, and the main technical challenge of point cloud denoising is how to Effectively preserve the features of the model while removing noise.
目前常用的点集滤波方法,如局部最优投影(LOP)、鲁棒隐式移动最小二乘(RIMLS)、加权LOP(WLOP)、边缘感知重采样(EAR-aware resampling)和连续LOP(CLOP),都具有显著的优势。然而,这些点集滤波方法要么不能保留清晰的特征,要么去除噪声的鲁棒性较差。其中LOP、WLOP和CLOP都是基于LOP的方法,能够很好地去除噪声和离群点,但由于它们固有的各向同性性质,不能保留其清晰的特征;EAR是一种扩展的基于LOP的方法,虽然保留了几何特征,但是因为它需要利用相当大的邻域大小,可能会抹去精细尺度的几何特征;RIMLS也保留了特征,但由于对初始法线估计的强依赖性,与基于LOP的方法相比,它通常对离群点和噪声更敏感。以上问题严重限制了这些方法在点群去噪中的鲁棒性和有效性。Currently commonly used point set filtering methods, such as local optimal projection (LOP), robust implicit moving least squares (RIMLS), weighted LOP (WLOP), edge-aware resampling (EAR-aware resampling) and continuous LOP (CLOP) ), all have significant advantages. However, these point set filtering methods either fail to preserve clear features or are less robust to noise removal. Among them, LOP, WLOP and CLOP are all LOP-based methods, which can remove noise and outliers well, but cannot retain their clear features due to their inherent isotropic properties; EAR is an extended LOP-based method. method, while preserving geometric features, may erase fine-scale geometric features because it needs to exploit a rather large neighborhood size; RIMLS also preserves features, but differs from the Compared to LOP methods, it is generally more sensitive to outliers and noise. The above problems severely limit the robustness and effectiveness of these methods in point group denoising.
发明内容SUMMARY OF THE INVENTION
本发明的目的在于提供一种去噪精度高,并且能够保留模型特征、对于不同程度的噪声有着较好鲁棒性的基于曲率和邻域重构的加权引导点云模型去噪方法。The purpose of the present invention is to provide a weighted guide point cloud model denoising method based on curvature and neighborhood reconstruction, which has high denoising accuracy, can retain model features, and has good robustness to different degrees of noise.
实现本发明目的的技术解决方案为:一种基于曲率和邻域重构的加权引导点云模型去噪方法,包括以下步骤:The technical solution for realizing the object of the present invention is: a weighted guidance point cloud model denoising method based on curvature and neighborhood reconstruction, comprising the following steps:
步骤1,计算点云模型中每个点的曲率信息,根据设定的阈值,将模型中的特征点提取出来;Step 1: Calculate the curvature information of each point in the point cloud model, and extract the feature points in the model according to the set threshold;
步骤2,根据提取出来的特征点,在由K近邻法获取的邻域的基础上重构邻域点,并使得重构出的邻域在一个面上;Step 2, according to the extracted feature points, reconstruct the neighborhood points on the basis of the neighborhood obtained by the K-nearest neighbor method, and make the reconstructed neighborhood on one surface;
步骤3,根据重构出的邻域,利用每个点的三维位置信息作为引导信号,同时将曲率信息作为加权信号加入到位置引导信号中,从而对点云模型中的每个点做线性变换;Step 3: According to the reconstructed neighborhood, use the three-dimensional position information of each point as a guide signal, and add the curvature information as a weighted signal to the position guide signal, so as to perform linear transformation on each point in the point cloud model. ;
步骤4,根据步骤3计算出的线性变换系数,对每个点进行线性变换,实现点云模型去噪。Step 4: Perform linear transformation on each point according to the linear transformation coefficients calculated in Step 3 to realize denoising of the point cloud model.
进一步地,步骤1所述的计算点云模型中每个点的曲率信息,根据设定的阈值,将模型中的特征点提取出来,具体如下:Further, in the calculation of the curvature information of each point in the point cloud model described in step 1, the feature points in the model are extracted according to the set threshold, as follows:
步骤1.1、对于每一个点pi,计算它对应于邻域Ni的曲率值σ(Ni)为Step 1.1. For each point p i , calculate its curvature value σ(N i ) corresponding to the neighborhood N i as
其中,λ0、λ1、λ2是Ni的协方差矩阵的奇异值,且λ0<λ1<λ2,反映了Ni三个正交奇异向量的分布;Among them, λ 0 , λ 1 , λ 2 are the singular values of the covariance matrix of Ni, and λ 0 <λ 1 <λ 2 , reflecting the distribution of three orthogonal singular vectors of Ni;
步骤1.2、设置阈值t,曲率值大于阈值t的点为特征点,曲率值小于阈值t的点为非特征点。Step 1.2. Set the threshold t, the points with the curvature value greater than the threshold t are the feature points, and the points with the curvature value less than the threshold t are the non-feature points.
进一步地,步骤2所述的根据提取出来的特征点,在由K近邻法获取的邻域的基础上重构邻域点,并使得重构出的邻域在一个面上,具体如下:Further, according to the extracted feature points described in step 2, the neighborhood points are reconstructed on the basis of the neighborhood obtained by the K-nearest neighbor method, and the reconstructed neighborhood is on one plane, as follows:
步骤2.1、使用K近邻法为每个特征点pi赋予一个初始的邻域N;Step 2.1. Use the K-nearest neighbor method to assign an initial neighborhood N to each feature point p i ;
步骤2.2、针对初始的邻域N中的每一个邻域点pij,同样利用K近邻法得到该邻域点pij的邻域Nij,同时将特征点pi在pij处的候选邻域初始化为只包含其自身pij和特征点pi两个点;Step 2.2. For each neighborhood point p ij in the initial neighborhood N, also use the K-nearest neighbor method to obtain the neighborhood N ij of the neighborhood point p ij , and at the same time select the candidate neighbor of the feature point p i at p ij area Initialized to include only two points of its own p ij and feature point p i ;
步骤2.3、扫描Nij中的每一个点,判断该点是否能够加入候选邻域中,根据当前邻域的曲率值以及点的位置关系构建下式评判标准:Step 2.3. Scan each point in N ij to determine whether the point can be added to the candidate neighborhood , the following evaluation criteria are constructed according to the curvature value of the current neighborhood and the positional relationship of the points:
其中,表示衡量当前邻域的曲率值以及邻域中点的位置关系的标准值,表示pij在邻域下的曲率值,K代表邻域中所有点的个数,α和β为用户自定义的控制系数;pijk表示邻域中的第k个点,k=1,2,…,K,K表示邻域中点的总数;in, Represents the standard value for measuring the curvature value of the current neighborhood and the positional relationship of the points in the neighborhood, Indicates that p ij is in the neighborhood The curvature value under , K represents the neighborhood The number of all points in , α and β are user-defined control coefficients; p ijk represents the neighborhood The kth point in , k=1,2,...,K, K represents the neighborhood the total number of midpoints;
步骤2.4、如果加入该点后使得式(2)中的值减小,则代表该点能够加入到候选邻域中,并将距离该点最近的5个点也加入到候选邻域中;Step 2.4. If this point is added, the formula (2) is The value of is reduced, it means that the point can be added to the candidate neighborhood , and the 5 points closest to this point are also added to the candidate neighborhood middle;
步骤2.5、对于N中的其余点,均得到一个包含特征点pi在内的候选邻域,对于每一个候选邻域,根据式(2)计算的值,其中最小的一个值对应的邻域即为该特征点pi重构出的邻域N'。Step 2.5. For the remaining points in N, a candidate neighborhood including the feature point p i is obtained. For each candidate neighborhood, calculate according to formula (2). , and the neighborhood corresponding to the smallest value is the neighborhood N' reconstructed by the feature point p i .
进一步地,步骤3所述的根据重构出的邻域,利用每个点的三维位置信息作为引导信号,同时将曲率信息作为加权信号加入到位置引导信号中,从而对点云模型中的每个点做线性变换,具体如下:Further, according to the reconstructed neighborhood described in step 3, the three-dimensional position information of each point is used as a guide signal, and the curvature information is added to the position guide signal as a weighted signal, so that each point in the point cloud model is used. A point is linearly transformed, as follows:
加权引导滤波算法的代价函数E为:The cost function E of the weighted guided filtering algorithm is:
γ(i)=(σ-t)s(i)+χ (4)γ(i)=(σ-t) s(i) +χ (4)
s(i)=-sgn(σ-t)×μ×σ (5)s(i)=-sgn(σ-t)×μ×σ (5)
其中,N(pi)表示当前点pi的邻域,pij为该邻域中的点,ai和bi为待求的线性变换系数,ε为控制滤波效果的参数;σ为邻域重构之前计算的点的曲率值,t为判断特征点的阈值;χ为一个正数,用于防止权值γ(i)为0;μ为放大倍数,由动态决定。Among them, N(pi ) represents the neighborhood of the current point pi , p ij is the point in the neighborhood, a i and bi are the linear transformation coefficients to be obtained, ε is the parameter controlling the filtering effect; σ is the neighborhood The curvature value of the point calculated before the domain reconstruction, t is the threshold for judging the feature point; χ is a positive number, used to prevent the weight γ(i) from being 0; μ is the magnification, given by Dynamic decision.
进一步地,步骤4所述的根据步骤3计算出的线性变换系数,对每个点进行线性变换,实现点云模型去噪,具体如下:Further, according to the linear transformation coefficient calculated in step 3 described in step 4, linear transformation is performed on each point to realize denoising of the point cloud model, as follows:
步骤4.1、由步骤3得到线性变换的系数ai、bi为:Step 4.1. The coefficients a i and b i of the linear transformation obtained from step 3 are:
其中:in:
其中,|N(pi)|表示点pi的邻域中包含的点的个数,pij是pi的邻域N(pi)里的一点,为邻域的中心点,ε为控制滤波效果的参数;Among them, |N(pi )| represents the number of points contained in the neighborhood of point pi , p ij is a point in the neighborhood N( pi ) of pi , is the center point of the neighborhood, and ε is the parameter that controls the filtering effect;
步骤4.2、根据得到的线性变换系数ai和bi,对每个特征点进行线性变换,得到去噪后点的位置,所有点更新完毕后得到去噪后的点云模型。Step 4.2. According to the obtained linear transformation coefficients a i and b i , perform linear transformation on each feature point to obtain the position of the denoised point, and obtain the denoised point cloud model after all points are updated.
本发明与现有技术相比,具有以下显著优点:(1)输入简单,仅需输入点云模型点的位置信息,无需依赖初始法线估计;(2)引入了曲率信息作为加权信号,将模型的特征区域与平坦区域分开处理,因而更好地保留了模型的尖锐特征;(3)通过重构特征点的邻域,使得每个点获得一个相对平滑一致的邻域,因而对不同程度的噪声具有鲁棒性。Compared with the prior art, the present invention has the following significant advantages: (1) the input is simple, only the position information of the point cloud model point needs to be input, and there is no need to rely on the initial normal estimation; (2) the curvature information is introduced as a weighted signal, and the The feature area of the model is processed separately from the flat area, so the sharp features of the model are better preserved; (3) By reconstructing the neighborhood of the feature points, each point obtains a relatively smooth and consistent neighborhood, so the different degrees of noise is robust.
附图说明Description of drawings
图1是本发明基于曲率和邻域重构的加权引导点云模型去噪方法的流程示意图。FIG. 1 is a schematic flowchart of the weighted guided point cloud model denoising method based on curvature and neighborhood reconstruction of the present invention.
图2是本发明中特征点邻域重构的流程框架图。FIG. 2 is a flow frame diagram of feature point neighborhood reconstruction in the present invention.
图3是本发明中加权引导滤波方法的框架图。FIG. 3 is a frame diagram of the weighted guided filtering method in the present invention.
图4是本发明实施例中的去噪效果图,其中(a)为输入带噪声的点云模型示意图,(b)为输出去噪后的点云模型示意图。4 is a denoising effect diagram in an embodiment of the present invention, wherein (a) is a schematic diagram of an input point cloud model with noise, and (b) is a schematic diagram of an output point cloud model after denoising.
图5是本发明实施例中的去噪效果图,其中(a)为输入带噪声的点云模型示意图,(b)为输出去噪后的点云模型示意图。5 is a denoising effect diagram in an embodiment of the present invention, wherein (a) is a schematic diagram of an input point cloud model with noise, and (b) is a schematic diagram of an output point cloud model after denoising.
具体实施方式Detailed ways
本发明基于曲率和邻域重构的加权引导点云模型去噪方法,包括以下步骤:The weighted guidance point cloud model denoising method based on curvature and neighborhood reconstruction of the present invention includes the following steps:
步骤1,计算点云模型中每个点的曲率信息,根据设定的阈值,将模型中的特征点提取出来;Step 1: Calculate the curvature information of each point in the point cloud model, and extract the feature points in the model according to the set threshold;
步骤2,根据提取出来的特征点,在由K近邻法获取的邻域的基础上重构邻域点,并使得重构出的邻域在一个面上;Step 2, according to the extracted feature points, reconstruct the neighborhood points on the basis of the neighborhood obtained by the K-nearest neighbor method, and make the reconstructed neighborhood on one surface;
步骤3,根据重构出的邻域,利用每个点的三维位置信息作为引导信号,同时将曲率信息作为加权信号加入到位置引导信号中,从而对点云模型中的每个点做线性变换;Step 3: According to the reconstructed neighborhood, use the three-dimensional position information of each point as a guide signal, and add the curvature information as a weighted signal to the position guide signal, so as to perform linear transformation on each point in the point cloud model. ;
步骤4,根据步骤3计算出的线性变换系数,对每个点进行线性变换,实现点云模型去噪。Step 4: Perform linear transformation on each point according to the linear transformation coefficients calculated in Step 3 to realize denoising of the point cloud model.
作为一种具体示例,步骤1所述的计算点云模型中每个点的曲率信息,根据设定的阈值,将模型中的特征点提取出来,具体如下:As a specific example, the curvature information of each point in the point cloud model is calculated in step 1, and the feature points in the model are extracted according to the set threshold, as follows:
步骤1.1、对于每一个点pi,计算它对应于邻域Ni的曲率值σ(Ni)为Step 1.1. For each point p i , calculate its curvature value σ(N i ) corresponding to the neighborhood N i as
其中,λ0、λ1、λ2是Ni的协方差矩阵的奇异值,且λ0<λ1<λ2,反映了Ni三个正交奇异向量的分布;Among them, λ 0 , λ 1 , λ 2 are the singular values of the covariance matrix of Ni, and λ 0 <λ 1 <λ 2 , reflecting the distribution of three orthogonal singular vectors of Ni;
步骤1.2、设置阈值t,曲率值大于阈值t的点为特征点,曲率值小于阈值t的点为非特征点。Step 1.2. Set the threshold t, the points with the curvature value greater than the threshold t are the feature points, and the points with the curvature value less than the threshold t are the non-feature points.
进一步地,步骤2所述的根据提取出来的特征点,在由K近邻法获取的邻域的基础上重构邻域点,并使得重构出的邻域在一个面上,具体如下:Further, according to the extracted feature points described in step 2, the neighborhood points are reconstructed on the basis of the neighborhood obtained by the K-nearest neighbor method, and the reconstructed neighborhood is on one plane, as follows:
步骤2.1、使用K近邻法为每个特征点pi赋予一个初始的邻域N;Step 2.1. Use the K-nearest neighbor method to assign an initial neighborhood N to each feature point p i ;
步骤2.2、针对初始的邻域N中的每一个邻域点pij,同样利用K近邻法得到该邻域点pij的邻域Nij,同时将特征点pi在pij处的候选邻域初始化为只包含其自身pij和特征点pi两个点;Step 2.2. For each neighborhood point p ij in the initial neighborhood N, also use the K-nearest neighbor method to obtain the neighborhood N ij of the neighborhood point p ij , and at the same time select the candidate neighbor of the feature point p i at p ij area Initialized to include only two points of its own p ij and feature point p i ;
步骤2.3、扫描Nij中的每一个点,判断该点是否能够加入候选邻域中,根据当前邻域的曲率值以及点的位置关系构建下式评判标准:Step 2.3. Scan each point in N ij to determine whether the point can be added to the candidate neighborhood , the following evaluation criteria are constructed according to the curvature value of the current neighborhood and the positional relationship of the points:
其中,表示衡量当前邻域的曲率值以及邻域中点的位置关系的标准值,表示pij在邻域下的曲率值,K代表邻域中所有点的个数,α和β为用户自定义的控制系数;pijk表示邻域中的第k个点,k=1,2,…,K,K表示邻域中点的总数;in, Represents the standard value for measuring the curvature value of the current neighborhood and the positional relationship of the points in the neighborhood, Indicates that p ij is in the neighborhood The curvature value under , K represents the neighborhood The number of all points in , α and β are user-defined control coefficients; p ijk represents the neighborhood The kth point in , k=1,2,...,K, K represents the neighborhood the total number of midpoints;
步骤2.4、如果加入该点后使得式(2)中的值减小,则代表该点能够加入到候选邻域中,并将距离该点最近的5个点也加入到候选邻域中;Step 2.4. If this point is added, the formula (2) is The value of is reduced, it means that the point can be added to the candidate neighborhood , and the 5 points closest to this point are also added to the candidate neighborhood middle;
步骤2.5、对于N中的其余点,均得到一个包含特征点pi在内的候选邻域,对于每一个候选邻域,根据式(2)计算的值,其中最小的一个值对应的邻域即为该特征点pi重构出的邻域N'。Step 2.5. For the remaining points in N, a candidate neighborhood including the feature point p i is obtained. For each candidate neighborhood, calculate according to formula (2). , and the neighborhood corresponding to the smallest value is the neighborhood N' reconstructed by the feature point p i .
作为一种具体示例,步骤3所述的根据重构出的邻域,利用每个点的三维位置信息作为引导信号,同时将曲率信息作为加权信号加入到位置引导信号中,从而对点云模型中的每个点做线性变换,具体如下:As a specific example, according to the reconstructed neighborhood described in step 3, the three-dimensional position information of each point is used as the guiding signal, and the curvature information is added to the position guiding signal as a weighted signal, so as to improve the accuracy of the point cloud model. Each point in the linear transformation is performed as follows:
加权引导滤波算法的代价函数E为:The cost function E of the weighted guided filtering algorithm is:
γ(i)=(σ-t)s(i)+χ (4)γ(i)=(σ-t) s(i) +χ (4)
s(i)=-sgn(σ-t)×μ×σ (5)s(i)=-sgn(σ-t)×μ×σ (5)
其中,N(pi)表示当前点pi的邻域,pij为该邻域中的点,ai和bi为待求的线性变换系数,ε为控制滤波效果的参数;σ为邻域重构之前计算的点的曲率值,t为判断特征点的阈值;χ为一个正数,用于防止权值γ(i)为0;μ为放大倍数,由动态决定。Among them, N(pi ) represents the neighborhood of the current point pi , p ij is the point in the neighborhood, a i and bi are the linear transformation coefficients to be obtained, ε is the parameter controlling the filtering effect; σ is the neighborhood The curvature value of the point calculated before the domain reconstruction, t is the threshold for judging the feature point; χ is a positive number, used to prevent the weight γ(i) from being 0; μ is the magnification, determined by Dynamic decision.
作为一种具体示例,步骤4所述的根据步骤3计算出的线性变换系数,对每个点进行线性变换,实现点云模型去噪,具体如下:As a specific example, step 4 performs linear transformation on each point according to the linear transformation coefficient calculated in step 3 to realize denoising of the point cloud model, as follows:
步骤4.1、由步骤3得到线性变换的系数ai、bi为:Step 4.1. The coefficients a i and b i of the linear transformation obtained from step 3 are:
其中:in:
其中,|N(pi)|表示点pi的邻域中包含的点的个数,pij是pi的邻域N(pi)里的一点,为邻域的中心点,ε为控制滤波效果的参数;Among them, |N(pi )| represents the number of points contained in the neighborhood of point pi , p ij is a point in the neighborhood N( pi ) of pi , is the center point of the neighborhood, ε is the parameter that controls the filtering effect;
步骤4.2、根据得到的线性变换系数ai和bi,对每个特征点进行线性变换,得到去噪后点的位置,所有点更新完毕后得到去噪后的点云模型。Step 4.2. According to the obtained linear transformation coefficients a i and b i , perform linear transformation on each feature point to obtain the position of the denoised point, and obtain the denoised point cloud model after all points are updated.
下面结合附图及具体实施例对本发明作进一步详细说明。The present invention will be described in further detail below with reference to the accompanying drawings and specific embodiments.
实施例Example
结合图1,本发明基于曲率和邻域重构的加权引导点云模型去噪方法,包括以下步骤:1, the weighted guidance point cloud model denoising method based on curvature and neighborhood reconstruction of the present invention includes the following steps:
步骤1,计算点云模型中每个点的曲率信息,根据设定的阈值,将模型中的特征点提取出来,具体如下:Step 1: Calculate the curvature information of each point in the point cloud model, and extract the feature points in the model according to the set threshold, as follows:
步骤1.1、对于每一个点pi,计算它对应于邻域Ni的曲率值σ(Ni)为:Step 1.1. For each point p i , calculate its curvature value σ(N i ) corresponding to the neighborhood N i as:
其中,λ0、λ1、λ2是Ni的协方差矩阵的奇异值,且λ0<λ1<λ2,反映了Ni三个正交奇异向量的分布;Among them, λ 0 , λ 1 , λ 2 are the singular values of the covariance matrix of Ni, and λ 0 <λ 1 <λ 2 , reflecting the distribution of three orthogonal singular vectors of Ni;
步骤1.2、设置阈值t,曲率值大于阈值t的点为特征点,曲率值小于阈值t的点为非特征点。Step 1.2. Set the threshold t, the points with the curvature value greater than the threshold t are the feature points, and the points with the curvature value less than the threshold t are the non-feature points.
步骤2,根据提取出来的特征点,在由K近邻法获取的邻域的基础上重构邻域点,并使得重构出的邻域在一个面上,结合图2,具体如下:Step 2, according to the extracted feature points, reconstruct the neighborhood points on the basis of the neighborhood obtained by the K-nearest neighbor method, and make the reconstructed neighborhood on one plane, combined with Figure 2, as follows:
步骤2.1、使用K近邻法为每个特征点pi赋予一个初始的邻域N;Step 2.1. Use the K-nearest neighbor method to assign an initial neighborhood N to each feature point p i ;
步骤2.2、针对初始的邻域N中的每一个邻域点pij,同样利用K近邻法得到该邻域点pij的邻域Nij,同时将特征点pi在pij处的候选邻域初始化为只包含其自身pij和特征点pi两个点;Step 2.2. For each neighborhood point p ij in the initial neighborhood N, also use the K-nearest neighbor method to obtain the neighborhood N ij of the neighborhood point p ij , and at the same time select the candidate neighbor of the feature point p i at p ij area Initialized to include only two points of its own p ij and feature point p i ;
步骤2.3、扫描Nij中的每一个点,判断该点是否能够加入候选邻域中,根据当前邻域的曲率值以及点的位置关系构建下式评判标准:Step 2.3. Scan each point in N ij to determine whether the point can be added to the candidate neighborhood , the following evaluation criteria are constructed according to the curvature value of the current neighborhood and the positional relationship of the points:
其中,表示衡量当前邻域的曲率值以及邻域中点的位置关系的标准值,表示pij在邻域下的曲率值,K代表邻域中所有点的个数,α和β为用户自定义的控制系数;pijk表示邻域中的第k个点,k=1,2,…,K,K表示邻域中点的总数;in, Represents the standard value for measuring the curvature value of the current neighborhood and the positional relationship of the points in the neighborhood, Indicates that p ij is in the neighborhood The curvature value under , K represents the neighborhood The number of all points in , α and β are user-defined control coefficients; p ijk represents the neighborhood The kth point in , k=1,2,...,K, K represents the neighborhood the total number of midpoints;
步骤2.4、如果加入该点后使得式(2)中的值减小,则代表该点能够加入到候选邻域中,并将距离该点最近的5个点也加入到候选邻域中;Step 2.4. If this point is added, the formula (2) is The value of is reduced, it means that the point can be added to the candidate neighborhood , and the 5 points closest to this point are also added to the candidate neighborhood middle;
步骤2.5、对于N中的其余点,均得到一个包含特征点pi在内的候选邻域,对于每一个候选邻域,根据式(2)计算的值,其中最小的一个值对应的邻域即为该特征点pi重构出的邻域N'。Step 2.5. For the remaining points in N, a candidate neighborhood including the feature point p i is obtained. For each candidate neighborhood, calculate according to formula (2). , and the neighborhood corresponding to the smallest value is the neighborhood N' reconstructed by the feature point p i .
步骤3,根据重构出的邻域,利用每个点的三维位置信息作为引导信号,同时将曲率信息作为加权信号加入到位置引导信号中,从而对点云模型中的每个点做线性变换,结合图3,具体如下:Step 3: According to the reconstructed neighborhood, use the three-dimensional position information of each point as a guide signal, and add the curvature information as a weighted signal to the position guide signal, so as to perform linear transformation on each point in the point cloud model. , combined with Figure 3, as follows:
传统的引导滤波算法由于其对于点云模型的各个部分都使用统一的线性模型和相同的正则化参数,所以会平滑掉特征区域,采用融合曲率信息的加权引导点云去噪方法。一个有效的引导滤波权值模型需要解决两个问题:第一、该权值所借助的点云模型处理方法应该能够准确的识别出模型的特征区域;第二、在特征区域,应叠加较小的平滑倍数,即最终的正则项应较小,则分母处的权值应较大;在模型的平坦区域,应该叠加稍大的平滑倍数,即最终的正则项应稍大,则分母处的权值应较小。在点云处理领域中,大多数点云的特征点都可以通过计算每个点的曲率信息提取出来。The traditional guided filtering algorithm uses a unified linear model and the same regularization parameter for each part of the point cloud model, so it will smooth out the feature area, and use a weighted guided point cloud denoising method that fuses curvature information. An effective guided filtering weight model needs to solve two problems: first, the point cloud model processing method used by the weights should be able to accurately identify the feature area of the model; second, in the feature area, the superposition should be smaller The smoothing multiple of , that is, the final regular term should be smaller, the weight at the denominator should be larger; in the flat area of the model, a slightly larger smoothing multiple should be superimposed, that is, the final regular term should be slightly larger, then the denominator should be slightly larger. The weights should be small. In the field of point cloud processing, the feature points of most point clouds can be extracted by calculating the curvature information of each point.
此外,理想的权值模型要求其在模型平坦区域时权值较小,在特征区域权值较大。由于权值变化规律和指数函数的变化规律较为相近,因此可以将点的曲率信息作为底数,通过基于指数函数的权值模型来放大或抑制点的曲率信息。为了得到模型的特征区域,设置特征点曲率阈值t,当某点的曲率值大于t,则认为该点为特征点,否则为非特征点。为了使曲率信息得到更为合理的应用,向权值γ(i)内部引入一个约束因子s(i)作为权值模型的指数项,该约束因子能为权值设置一个约束边界,使它能准确地决策出对于不同区域应采取的不同加权行为,使得对于特征区域,表现为对特征信息敏感,放大特征点处信息;当对于平坦区域时,表现为对特征信息不敏感,抑制特征信息增长,从而达到保留特征的目的。In addition, an ideal weight model requires a smaller weight in the flat area of the model and a larger weight in the feature area. Since the change law of the weight value is similar to that of the exponential function, the curvature information of the point can be used as the base, and the weight model based on the exponential function can be used to amplify or suppress the curvature information of the point. In order to obtain the feature area of the model, the feature point curvature threshold t is set. When the curvature value of a point is greater than t, the point is considered as a feature point, otherwise it is a non-feature point. In order to make the curvature information more reasonable, a constraint factor s(i) is introduced into the weight γ(i) as the exponential term of the weight model. The constraint factor can set a constraint boundary for the weight, so that it can Accurately determine the different weighting behaviors that should be taken for different regions, so that for feature regions, it is sensitive to feature information and amplifies the information at feature points; for flat regions, it is insensitive to feature information and inhibits the growth of feature information. , so as to achieve the purpose of retaining features.
基于上述分析,权值定义为:Based on the above analysis, the weights are defined as:
γ(i)=(σ-t)s(i)+χγ(i)=(σ-t) s(i) +χ
s(i)=-sgn(σ-t)×μ×σs(i)=-sgn(σ-t)×μ×σ
其中σ为邻域重构之前计算的点的曲率值,t为判断特征点的阈值,μ为放大倍数,由动态决定,α为一个常数项,用于防止γ(i)作为分母为零的情况。where σ is the curvature value of the point calculated before neighborhood reconstruction, t is the threshold for judging feature points, and μ is the magnification, which is defined by Dynamically determined, α is a constant term that prevents γ(i) as a zero denominator.
显然,当点属于特征点时,s(i)符号为负,此时曲率越大即特征信息越显著则权值越大,表现为对特征信息敏感;当点不属于特征点时,s(i)符号为正,此时的权值非常小,表现为对特征信息不敏感。Obviously, when the point belongs to the feature point, the sign of s(i) is negative. At this time, the greater the curvature, the more significant the feature information, the greater the weight, which is sensitive to the feature information; when the point does not belong to the feature point, s( i) The sign is positive, and the weight at this time is very small, which is insensitive to feature information.
最终结合权值在引导滤波的基础上进行改写,则代价函数为:Finally, the combined weights are rewritten on the basis of guided filtering, and the cost function is:
其中N(pi)表示当前点pi的邻域,pij为该邻域中的点,ai和bi为待求的线性变换系数,ε为控制滤波效果的参数。where N(pi ) represents the neighborhood of the current point pi, p ij is the point in the neighborhood, a i and bi are the linear transformation coefficients to be obtained , and ε is a parameter that controls the filtering effect.
步骤4,根据步骤3计算出的线性变换系数,对每个点进行线性变换,实现点云模型去噪,具体如下:Step 4: Perform linear transformation on each point according to the linear transformation coefficient calculated in Step 3 to realize denoising of the point cloud model, as follows:
步骤4.1、由步骤3得到线性变换的系数为:Step 4.1, the coefficient of linear transformation obtained from step 3 is:
其中:in:
其中,|N(pi)|表示点pi的邻域中包含的点的个数,pij是pi的邻域N(pi)里的一点,为邻域的中心点,ε为控制滤波效果的参数;Among them, |N(pi )| represents the number of points contained in the neighborhood of point pi , p ij is a point in the neighborhood N( pi ) of pi , is the center point of the neighborhood, ε is the parameter that controls the filtering effect;
步骤4.2、根据得到的线性变换系数ai和bi,对每个特征点进行线性变换,得到去噪后的点的位置,所有点更新完毕后得到去噪后的点云模型。Step 4.2. According to the obtained linear transformation coefficients a i and b i , perform linear transformation on each feature point to obtain the position of the denoised point, and obtain the denoised point cloud model after all points are updated.
图4是本发明实施例中的去噪效果图,其中图4(a)为输入带噪声的点云模型示意图,图4(b)为输出去噪后的点云模型示意图。图5是本发明实施例中的去噪效果图,其中图5(a)为输入带噪声的点云模型示意图,图5(b)为输出去噪后的点云模型示意图。根据图4和图5可知,采用本发明基于曲率和邻域重构的加权引导点云模型去噪方法进行点云模型去噪,能在去除噪声的同时保持模型的尖锐特征,证明本发明能广泛应用于各类模型。4 is a denoising effect diagram in an embodiment of the present invention, wherein FIG. 4(a) is a schematic diagram of an input point cloud model with noise, and FIG. 4(b) is a schematic diagram of an output point cloud model after denoising. 5 is a denoising effect diagram in an embodiment of the present invention, wherein FIG. 5(a) is a schematic diagram of an input point cloud model with noise, and FIG. 5(b) is a schematic diagram of an output point cloud model after denoising. It can be seen from Fig. 4 and Fig. 5 that the denoising method of the point cloud model based on the weighted guide point cloud model based on curvature and neighborhood reconstruction of the present invention is used to denoise the point cloud model, which can remove the noise while maintaining the sharp features of the model, which proves that the present invention can Widely used in various models.
Claims (5)
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910783574.3A CN112419164B (en) | 2019-08-23 | 2019-08-23 | Curvature and neighborhood reconstruction-based weighted guide point cloud model denoising method |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201910783574.3A CN112419164B (en) | 2019-08-23 | 2019-08-23 | Curvature and neighborhood reconstruction-based weighted guide point cloud model denoising method |
Publications (2)
Publication Number | Publication Date |
---|---|
CN112419164A true CN112419164A (en) | 2021-02-26 |
CN112419164B CN112419164B (en) | 2022-08-19 |
Family
ID=74780350
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201910783574.3A Active CN112419164B (en) | 2019-08-23 | 2019-08-23 | Curvature and neighborhood reconstruction-based weighted guide point cloud model denoising method |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN112419164B (en) |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114051625A (en) * | 2021-04-15 | 2022-02-15 | 商汤国际私人有限公司 | A method, device, equipment and storage medium for processing point cloud data |
Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20160125226A1 (en) * | 2013-09-17 | 2016-05-05 | Shenzhen Institutes Of Advanced Technology Chinese Academy Of Sciences | Method and system for automatically optimizing quality of point cloud data |
CN106709883A (en) * | 2016-12-20 | 2017-05-24 | 华南理工大学 | Point cloud denoising method based on joint bilateral filtering and sharp feature skeleton extraction |
-
2019
- 2019-08-23 CN CN201910783574.3A patent/CN112419164B/en active Active
Patent Citations (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20160125226A1 (en) * | 2013-09-17 | 2016-05-05 | Shenzhen Institutes Of Advanced Technology Chinese Academy Of Sciences | Method and system for automatically optimizing quality of point cloud data |
CN106709883A (en) * | 2016-12-20 | 2017-05-24 | 华南理工大学 | Point cloud denoising method based on joint bilateral filtering and sharp feature skeleton extraction |
Cited By (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN114051625A (en) * | 2021-04-15 | 2022-02-15 | 商汤国际私人有限公司 | A method, device, equipment and storage medium for processing point cloud data |
Also Published As
Publication number | Publication date |
---|---|
CN112419164B (en) | 2022-08-19 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Pu et al. | A fractional-order variational framework for retinex: fractional-order partial differential equation-based formulation for multi-scale nonlocal contrast enhancement with texture preserving | |
Fu et al. | A probabilistic method for image enhancement with simultaneous illumination and reflectance estimation | |
Zhang et al. | Adaptive fractional-order multi-scale method for image denoising | |
CN108205803B (en) | Image processing method, and training method and device of neural network model | |
Park et al. | Retinex method based on adaptive smoothing for illumination invariant face recognition | |
CN105096268B (en) | One kind point cloud denoising smooth method | |
CN111160229B (en) | SSD network-based video target detection method and device | |
CN106204461B (en) | In conjunction with the compound regularized image denoising method of non local priori | |
CN110223231A (en) | A kind of rapid super-resolution algorithm for reconstructing of noisy image | |
CN103971122B (en) | Three-dimensional face based on depth image describes method | |
CN104657951A (en) | Multiplicative noise removal method for image | |
CN115908984A (en) | Training method and device of image clustering model | |
Igbinosa | Comparison of edge detection technique in image processing techniques | |
CN108010002B (en) | A Structured Point Cloud Denoising Method Based on Adaptive Implicit Moving Least Squares | |
CN108510591A (en) | A kind of improvement Poisson curve reestablishing method based on non-local mean and bilateral filtering | |
CN112419164B (en) | Curvature and neighborhood reconstruction-based weighted guide point cloud model denoising method | |
Yi et al. | Illumination normalization of face image based on illuminant direction estimation and improved retinex | |
CN105303538B (en) | A kind of Gaussian noise variance method of estimation based on NSCT and PCA | |
CN111091107A (en) | A kind of face area edge detection method, device and storage medium | |
CN103955943A (en) | Non-supervision change detection method based on fuse change detection operators and dimension driving | |
CN107729863A (en) | Human body refers to vein identification method | |
CN104574400A (en) | Remote sensing image segmenting method based on local difference box dimension algorithm | |
JP2020098589A (en) | Curve object segmentation using geometric precursors | |
Ouyang et al. | Research on DENOISINg of cryo-em images based on deep learning | |
CN112529803B (en) | Feature-preserving three-dimensional Mesh model denoising method |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
CB03 | Change of inventor or designer information | ||
CB03 | Change of inventor or designer information |
Inventor after: Su Zhiyong Inventor after: Mei Jialin Inventor after: Yao Liang Inventor after: Li Qi Inventor after: Wang Han Inventor after: Li Huifang Inventor before: Mei Jialin Inventor before: Yao Liang Inventor before: Li Qi Inventor before: Wang Han Inventor before: Li Huifang Inventor before: Su Zhiyong |
|
GR01 | Patent grant | ||
GR01 | Patent grant |