activity
20172026
most citedFast and Robust Iterative Closest Point

344 citations · 715 across the 29 of their papers we have counts for

collaborators
Showing 2020Show all

6 papers · 1 filter

cs.LG2020★ 2 cited

Regularization of Persistent Homology Gradient Computation

Padraig Corcoran, Bailin Deng

Persistent homology is a method for computing the topological features present in a given data. Recently, there has been much interest in the integration of persistent homology as…

cs.CV2020★ 344 cited

Fast and Robust Iterative Closest Point

Juyong Zhang, Yuxin Yao, Bailin Deng

The Iterative Closest Point (ICP) algorithm and its variants are a fundamental technique for rigid registration between two point sets, with wide applications in different areas fr…

math.OC2020

Anderson Acceleration for Nonconvex ADMM Based on Douglas-Rachford Splitting

Wenqing Ouyang, Yue Peng, Yuxin Yao +2

The alternating direction multiplier method (ADMM) is widely used in computer graphics for solving optimization problems that can be nonsmooth and nonconvex. It converges quickly t…

math.OC2020★ 2 cited

Nonmonotone Globalization for Anderson Acceleration via Adaptive Regularization

Wenqing Ouyang, Jiong Tao, Andre Milzarek +1

Anderson acceleration (AA) is a popular method for accelerating fixed-point iterations, but may suffer from instability and stagnation. We propose a globalization method for AA to…

cs.CV2020★ 2 cited

Quasi-Newton Solver for Robust Non-Rigid Registration

Yuxin Yao, Bailin Deng, Weiwei Xu +1

Imperfect data (noise, outliers and partial overlap) and high degrees of freedom make non-rigid registration a classical challenging problem in computer vision. Existing methods ty…

cs.CV2020★ 1 cited

Lightweight Photometric Stereo for Facial Details Recovery

Xueying Wang, Yudong Guo, Bailin Deng +1

Recently, 3D face reconstruction from a single image has achieved great success with the help of deep learning and shape prior knowledge, but they often fail to produce accurate ge…