Algebraic method to speed up robust algorithms: example of laser-scanned point clouds
Surface reconstruction from point clouds generated by laser scanning technology has become a fundamental task in many fields of geosciences, such as robotics, computer vision, digital photogrammetry, computational geometry, digital building modelling, forest planning and operational activities. Poin...
| Main Authors: | , , , , , , |
|---|---|
| Format: | Journal Article |
| Published: |
Maney Publishing
2016
|
| Online Access: | http://hdl.handle.net/20.500.11937/21903 |
| _version_ | 1848750720942080000 |
|---|---|
| author | Paláncz, B. Awange, Joseph Lovas, T. Lewis, R. Molnár, B. Heck, B. Fukuda, Y. |
| author_facet | Paláncz, B. Awange, Joseph Lovas, T. Lewis, R. Molnár, B. Heck, B. Fukuda, Y. |
| author_sort | Paláncz, B. |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | Surface reconstruction from point clouds generated by laser scanning technology has become a fundamental task in many fields of geosciences, such as robotics, computer vision, digital photogrammetry, computational geometry, digital building modelling, forest planning and operational activities. Point clouds produced by laser scanning, however, are limited due to the occurrence of occlusions, multiple reflectance and noise, and off-surface points (outliers), thus necessitating the need for robust fitting techniques. In this contribution, a fast, non-iterative and data invariant algebraic algorithm with constant O(1) complexity that fits planes to point clouds in the total least squares sense using Gaussian-type error distribution is proposed. The maximum likelihood estimator method is used, resulting in a multivariate polynomial system that is solved in an algebraic way. It is shown that for plane fitting when datasets are affected heavily by outliers, the proposed algebraic method can be embedded into the framework of robust methods like the Danish or the RANdom SAmple Consensus methods and computed in parallel to provide rigorous algebraic fitting with significantly reduced running times. Compared to the embedded traditional singular value decomposition and principal component analysis approaches, the performance of the proposed algebraic algorithm demonstrated its efficiency on both synthetic data and real laser-scanned measurements.The evaluation of a symbolic algebraic formula is practically independent of the values of its coefficients; however, the computation of the coefficients depends on the complexity of the data. Since the main advantage of the symbolic solution is its non-requirement of numerical iteration, the data complexity will have weak influence on the speed-up. The novelty of the proposed method is the use of algebraic technique in a robust plane fitting algorithm that could be applied to remote sensing data analysis/delineation/classification. In general, the method could be applied to most plane fitting problems in the geoscience field. |
| first_indexed | 2025-11-14T07:41:19Z |
| format | Journal Article |
| id | curtin-20.500.11937-21903 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T07:41:19Z |
| publishDate | 2016 |
| publisher | Maney Publishing |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-219032017-10-02T06:05:37Z Algebraic method to speed up robust algorithms: example of laser-scanned point clouds Paláncz, B. Awange, Joseph Lovas, T. Lewis, R. Molnár, B. Heck, B. Fukuda, Y. Surface reconstruction from point clouds generated by laser scanning technology has become a fundamental task in many fields of geosciences, such as robotics, computer vision, digital photogrammetry, computational geometry, digital building modelling, forest planning and operational activities. Point clouds produced by laser scanning, however, are limited due to the occurrence of occlusions, multiple reflectance and noise, and off-surface points (outliers), thus necessitating the need for robust fitting techniques. In this contribution, a fast, non-iterative and data invariant algebraic algorithm with constant O(1) complexity that fits planes to point clouds in the total least squares sense using Gaussian-type error distribution is proposed. The maximum likelihood estimator method is used, resulting in a multivariate polynomial system that is solved in an algebraic way. It is shown that for plane fitting when datasets are affected heavily by outliers, the proposed algebraic method can be embedded into the framework of robust methods like the Danish or the RANdom SAmple Consensus methods and computed in parallel to provide rigorous algebraic fitting with significantly reduced running times. Compared to the embedded traditional singular value decomposition and principal component analysis approaches, the performance of the proposed algebraic algorithm demonstrated its efficiency on both synthetic data and real laser-scanned measurements.The evaluation of a symbolic algebraic formula is practically independent of the values of its coefficients; however, the computation of the coefficients depends on the complexity of the data. Since the main advantage of the symbolic solution is its non-requirement of numerical iteration, the data complexity will have weak influence on the speed-up. The novelty of the proposed method is the use of algebraic technique in a robust plane fitting algorithm that could be applied to remote sensing data analysis/delineation/classification. In general, the method could be applied to most plane fitting problems in the geoscience field. 2016 Journal Article http://hdl.handle.net/20.500.11937/21903 10.1080/00396265.2016.1183939 Maney Publishing restricted |
| spellingShingle | Paláncz, B. Awange, Joseph Lovas, T. Lewis, R. Molnár, B. Heck, B. Fukuda, Y. Algebraic method to speed up robust algorithms: example of laser-scanned point clouds |
| title | Algebraic method to speed up robust algorithms: example of laser-scanned point clouds |
| title_full | Algebraic method to speed up robust algorithms: example of laser-scanned point clouds |
| title_fullStr | Algebraic method to speed up robust algorithms: example of laser-scanned point clouds |
| title_full_unstemmed | Algebraic method to speed up robust algorithms: example of laser-scanned point clouds |
| title_short | Algebraic method to speed up robust algorithms: example of laser-scanned point clouds |
| title_sort | algebraic method to speed up robust algorithms: example of laser-scanned point clouds |
| url | http://hdl.handle.net/20.500.11937/21903 |