TY - JOUR
T1 - Surface reconstruction from unorganized points with l0 gradient minimization
AU - Li, Huibin
AU - Li, Yibao
AU - Yu, Ruixuan
AU - Sun, Jian
AU - Kim, Junseok
N1 - Funding Information:
Huibin Li is supported in part by the National Natural Science Foundation of China (NSFC) under Grant No. 11401464 . Yibao Li is supported by National Natural Science Foundation of China under Grant No. 11601416 and No. 11631012 . The corresponding author (Junseok Kim) was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education ( NRF-2016R1D1A1B03933243 ). The authors are grateful to the anonymous referees whose valuable suggestions and comments significantly improved the quality of this paper.
Publisher Copyright:
© 2018 Elsevier Inc.
PY - 2018/4
Y1 - 2018/4
N2 - To reconstruct surface from unorganized points in three-dimensional Euclidean space, we propose a novel efficient and fast method by using l0 gradient minimization, which can directly measure the sparsity of a solution and produce sharper surfaces. Therefore, the proposed method is particularly effective for sharpening major edges and removing noise. Unlike the Poisson surface reconstruction approach and its extensions, our method does not depend on the accurate directions of normal vectors of the unorganized points. The resulting algorithm is developed using a half-quadratic splitting method and is based on decoupled iterations that are alternating over a smoothing step realized by a Poisson approach and an edge-preserving step through an optimization formulation. This iterative algorithm is easy to implement. Various tests are presented to demonstrate that our method is robust to point noise, normal noise and data holes, and thus produces good surface reconstruction results.
AB - To reconstruct surface from unorganized points in three-dimensional Euclidean space, we propose a novel efficient and fast method by using l0 gradient minimization, which can directly measure the sparsity of a solution and produce sharper surfaces. Therefore, the proposed method is particularly effective for sharpening major edges and removing noise. Unlike the Poisson surface reconstruction approach and its extensions, our method does not depend on the accurate directions of normal vectors of the unorganized points. The resulting algorithm is developed using a half-quadratic splitting method and is based on decoupled iterations that are alternating over a smoothing step realized by a Poisson approach and an edge-preserving step through an optimization formulation. This iterative algorithm is easy to implement. Various tests are presented to demonstrate that our method is robust to point noise, normal noise and data holes, and thus produces good surface reconstruction results.
KW - Point cloud
KW - Surface reconstruction
KW - fast Fourier transform
KW - l gradient minimization
KW - l sparsity
UR - http://www.scopus.com/inward/record.url?scp=85041574617&partnerID=8YFLogxK
U2 - 10.1016/j.cviu.2018.01.009
DO - 10.1016/j.cviu.2018.01.009
M3 - Article
AN - SCOPUS:85041574617
VL - 169
SP - 108
EP - 118
JO - Computer Vision and Image Understanding
JF - Computer Vision and Image Understanding
SN - 1077-3142
ER -