Fast and robust motion averaging via angle constraints of multi‐view range scans

Abstract The motion averaging problem arises when recovering the motions for a set of scans in three‐dimensional (3D) reconstruction. Motion averaging is taken as an optimisation problem, whose solution can be obtained via matrix decomposition in principal component analysis. The latest motion avera...

詳細記述

書誌詳細
出版年:The Journal of Engineering
主要な著者: Xin Zhang, Yan Zhang, Chengzhi Qu, Zhuangbin Tan
フォーマット: 論文
言語:英語
出版事項: Wiley 2021-02-01
主題:
オンライン・アクセス:https://doi.org/10.1049/tje2.12014
_version_ 1852692627324928000
author Xin Zhang
Yan Zhang
Chengzhi Qu
Zhuangbin Tan
author_facet Xin Zhang
Yan Zhang
Chengzhi Qu
Zhuangbin Tan
author_sort Xin Zhang
collection DOAJ
container_title The Journal of Engineering
description Abstract The motion averaging problem arises when recovering the motions for a set of scans in three‐dimensional (3D) reconstruction. Motion averaging is taken as an optimisation problem, whose solution can be obtained via matrix decomposition in principal component analysis. The latest motion averaging methods utilize the Cauchy kernel function or overlap rate to construct the weighted matrix in the cost function, yielding weighted low‐rank sparse matrix decomposition solutions. Nevertheless, the over‐reliance on the initial value and high computational complexity remain two major problems. Here, we aim to improve the motion averaging performance via a fast and robust method based on the angle constraints of multiple scans. The additional term representing the angle constraint is added into the original cost function. By doing this, two benefits are facilitated: 1) the iteration times for the optimisation process are reduced; and 2) it effectively mitigates the over‐reliance on the initial value and thus caters for outliers and random noise of initial motions. Compared with state‐of‐the‐art motion averaging methods, it is indicated that the proposed method is more efficient and robust for numerical simulations of using both simulated motions and real 3D scanning data, given a large range of angle constraint values.
format Article
id doaj-art-8a527003f0b548ea8a27d44efcbd1b3d
institution Directory of Open Access Journals
issn 2051-3305
language English
publishDate 2021-02-01
publisher Wiley
record_format Article
spelling doaj-art-8a527003f0b548ea8a27d44efcbd1b3d2025-08-19T21:24:00ZengWileyThe Journal of Engineering2051-33052021-02-012021210411310.1049/tje2.12014Fast and robust motion averaging via angle constraints of multi‐view range scansXin Zhang0Yan Zhang1Chengzhi Qu2Zhuangbin Tan3School of Aeronautics and Astronautics Sun Yat‐sen University, Shenzhen Campus Gongchang road, Shenzhen, China Shenzhen 518106 ChinaSchool of Aeronautics and Astronautics Sun Yat‐sen University, Shenzhen Campus Gongchang road, Shenzhen, China Shenzhen 518106 ChinaSchool of Aeronautics and Astronautics Sun Yat‐sen University, Shenzhen Campus Gongchang road, Shenzhen, China Shenzhen 518106 ChinaSchool of Aeronautics and Astronautics Sun Yat‐sen University, Shenzhen Campus Gongchang road, Shenzhen, China Shenzhen 518106 ChinaAbstract The motion averaging problem arises when recovering the motions for a set of scans in three‐dimensional (3D) reconstruction. Motion averaging is taken as an optimisation problem, whose solution can be obtained via matrix decomposition in principal component analysis. The latest motion averaging methods utilize the Cauchy kernel function or overlap rate to construct the weighted matrix in the cost function, yielding weighted low‐rank sparse matrix decomposition solutions. Nevertheless, the over‐reliance on the initial value and high computational complexity remain two major problems. Here, we aim to improve the motion averaging performance via a fast and robust method based on the angle constraints of multiple scans. The additional term representing the angle constraint is added into the original cost function. By doing this, two benefits are facilitated: 1) the iteration times for the optimisation process are reduced; and 2) it effectively mitigates the over‐reliance on the initial value and thus caters for outliers and random noise of initial motions. Compared with state‐of‐the‐art motion averaging methods, it is indicated that the proposed method is more efficient and robust for numerical simulations of using both simulated motions and real 3D scanning data, given a large range of angle constraint values.https://doi.org/10.1049/tje2.12014AlgebraOptimisation techniquesInterpolation and function approximation (numerical analysis)Optical, image and video signal processingAlgebraOptimisation techniques
spellingShingle Xin Zhang
Yan Zhang
Chengzhi Qu
Zhuangbin Tan
Fast and robust motion averaging via angle constraints of multi‐view range scans
Algebra
Optimisation techniques
Interpolation and function approximation (numerical analysis)
Optical, image and video signal processing
Algebra
Optimisation techniques
title Fast and robust motion averaging via angle constraints of multi‐view range scans
title_full Fast and robust motion averaging via angle constraints of multi‐view range scans
title_fullStr Fast and robust motion averaging via angle constraints of multi‐view range scans
title_full_unstemmed Fast and robust motion averaging via angle constraints of multi‐view range scans
title_short Fast and robust motion averaging via angle constraints of multi‐view range scans
title_sort fast and robust motion averaging via angle constraints of multi view range scans
topic Algebra
Optimisation techniques
Interpolation and function approximation (numerical analysis)
Optical, image and video signal processing
Algebra
Optimisation techniques
url https://doi.org/10.1049/tje2.12014
work_keys_str_mv AT xinzhang fastandrobustmotionaveragingviaangleconstraintsofmultiviewrangescans
AT yanzhang fastandrobustmotionaveragingviaangleconstraintsofmultiviewrangescans
AT chengzhiqu fastandrobustmotionaveragingviaangleconstraintsofmultiviewrangescans
AT zhuangbintan fastandrobustmotionaveragingviaangleconstraintsofmultiviewrangescans