Non-local Low-rank Point Cloud Denoising for 3D Measurement Surfaces

Author(s):  
Dingkun Zhu ◽  
Honghua Chen ◽  
Weiming Wang ◽  
Haoran Xie ◽  
Gary Cheng ◽  
...  
Sensors ◽  
2018 ◽  
Vol 18 (11) ◽  
pp. 3729 ◽  
Author(s):  
Shuai Wang ◽  
Hua-Yan Sun ◽  
Hui-Chao Guo ◽  
Lin Du ◽  
Tian-Jian Liu

Global registration is an important step in the three-dimensional reconstruction of multi-view laser point clouds for moving objects, but the severe noise, density variation, and overlap ratio between multi-view laser point clouds present significant challenges to global registration. In this paper, a multi-view laser point cloud global registration method based on low-rank sparse decomposition is proposed. Firstly, the spatial distribution features of point clouds were extracted by spatial rasterization to realize loop-closure detection, and the corresponding weight matrix was established according to the similarities of spatial distribution features. The accuracy of adjacent registration transformation was evaluated, and the robustness of low-rank sparse matrix decomposition was enhanced. Then, the objective function that satisfies the global optimization condition was constructed, which prevented the solution space compression generated by the column-orthogonal hypothesis of the matrix. The objective function was solved by the Augmented Lagrange method, and the iterative termination condition was designed according to the prior conditions of single-object global registration. The simulation analysis shows that the proposed method was robust with a wide range of parameters, and the accuracy of loop-closure detection was over 90%. When the pairwise registration error was below 0.1 rad, the proposed method performed better than the three compared methods, and the global registration accuracy was better than 0.05 rad. Finally, the global registration results of real point cloud experiments further proved the validity and stability of the proposed method.


2020 ◽  
Vol 12 (18) ◽  
pp. 2979
Author(s):  
Le Sun ◽  
Chengxun He ◽  
Yuhui Zheng ◽  
Songze Tang

During the process of signal sampling and digital imaging, hyperspectral images (HSI) inevitably suffer from the contamination of mixed noises. The fidelity and efficiency of subsequent applications are considerably reduced along with this degradation. Recently, as a formidable implement for image processing, low-rank regularization has been widely extended to the restoration of HSI. Meanwhile, further exploration of the non-local self-similarity of low-rank images are proven useful in exploiting the spatial redundancy of HSI. Better preservation of spatial-spectral features is achieved under both low-rank and non-local regularizations. However, existing methods generally regularize the original space of HSI, the exploration of the intrinsic properties in subspace, which leads to better denoising performance, is relatively rare. To address these challenges, a joint method of subspace low-rank learning and non-local 4-d transform filtering, named SLRL4D, is put forward for HSI restoration. Technically, the original HSI is projected into a low-dimensional subspace. Then, both spectral and spatial correlations are explored simultaneously by imposing low-rank learning and non-local 4-d transform filtering on the subspace. The alternating direction method of multipliers-based algorithm is designed to solve the formulated convex signal-noise isolation problem. Finally, experiments on multiple datasets are conducted to illustrate the accuracy and efficiency of SLRL4D.


Author(s):  
Cristian Ianculescu ◽  
Lonny L. Thompson

Parallel iterative methods for fast solution of large-scale acoustic radiation and scattering problems are developed using exact Dirichlet-to-Neumann (DtN), nonreflecting boundaries. A separable elliptic nonreflecting boundary is used to efficiently model unbounded regions surrounding elongated structures. We exploit the special structure of the non-local DtN map as a low-rank update of the system matrix to efficiently compute the matrix-by-vector products found in Krylov subspace based iterative methods. For the complex non-hermitian matrices resulting from the Helmholtz equation, we use a distributed-memory parallel BICG-STAB iterative method in conjunction with a parallel Jacobi preconditioner. Domain decomposition with interface minimization was performed to ensure optimal interprocessor communication. For the architectures tested, and using the MPICH version of MPI, we show that when implemented as a low-rank update, the non-local character of the DtN map does not signicantly decrease the scale up and parallel eciency versus a purely approximate local boundary condition.


2019 ◽  
Vol 367 ◽  
pp. 1-12 ◽  
Author(s):  
Xiao-Tong Li ◽  
Xi-Le Zhao ◽  
Tai-Xiang Jiang ◽  
Yu-Bang Zheng ◽  
Teng-Yu Ji ◽  
...  

2014 ◽  
Vol 34 (6) ◽  
pp. 111-122 ◽  
Author(s):  
Wei Li ◽  
Lei Zhao ◽  
Zhijie Lin ◽  
Duanqing Xu ◽  
Dongming Lu

Sign in / Sign up

Export Citation Format

Share Document