Sparse sampling and reconstruction for freeform surface based on low-rank matrix completion

Author(s):  
Kang Gu ◽  
Sheng Chen ◽  
Xiaoyu You ◽  
Yifei Li ◽  
Jianwei Cui ◽  
...  

Abstract The coordinate measuring machine (CMM) becomes an extensive and effective method for high precision inspection of free-form surfaces due to its ability to measure complex and irregular surfaces. Sampling strategy and surface restoration method have an important influence on the efficiency and precision of CMM. In this paper, a sparse sampling strategy and surface reconstruction method for free-form surfaces based on low-rank matrix completion (LRMC) is proposed. In this method, the free-form surface is sampled randomly with uniform distribution in the cartesian coordinate system to obtain sparse sampling points, and then optimizes the scanning path to obtain the shortest path through all measurement points, and finally, the LRMC algorithm based on alternating root mean square prop was used to reconstruct the surface with high precision. The simulation and experimental results show that under the premise of ensuring accuracy, the number of sampling points is greatly reduced and the measurement efficiency is greatly improved.

2020 ◽  
Vol 2020 ◽  
pp. 1-14
Author(s):  
Yong-Hong Duan ◽  
Rui-Ping Wen ◽  
Yun Xiao

The singular value thresholding (SVT) algorithm plays an important role in the well-known matrix reconstruction problem, and it has many applications in computer vision and recommendation systems. In this paper, an SVT with diagonal-update (D-SVT) algorithm was put forward, which allows the algorithm to make use of simple arithmetic operation and keep the computational cost of each iteration low. The low-rank matrix would be reconstructed well. The convergence of the new algorithm was discussed in detail. Finally, the numerical experiments show the effectiveness of the new algorithm for low-rank matrix completion.


Sign in / Sign up

Export Citation Format

Share Document