About: 3d Scanner Point Cloud Denoising By Near Points Surface Fitting     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • The data obtained by 3D scanners with required higher accuracy and density contain disturbing noise, this noise makes the data processing, mainly by means of triangulated irregular networks using automated procedures, more complicated. The paper presents a new method of noise reduction based on natural redundancy of continuous objects and surfaces where, however, some deformation of the object shape occurs. The method involves a gradual choice of a selected number of the nearest points for each point of a scan, a selected surface is fitted with them and by the elongation or shortening of a beam with a given horizontal direction and the zenith angle onto the intersection with the surface a new (smoothed) position of the points is obtained. As the surface for fitting are used plane, polynomials of 2nd, 3rd and 4th degree. For the better calculation stability Chebyshev bivariant orthogonal polynomials are used. These surfaces are complemented by method using the mean. The solution of surface fitting may apply the least squares method with uniform weights or weights depending on distance, but also a robust method – the minimisation of the sum of absolute values of corrections (L1 norm). In spite of being always obtained in a certain order during the measurement, scanning data do not preserve this arrangement after their export, therefore, the procedure chosen for the searching of the neighbourhood of a point in a large point cloud (hundreds of thousands to millions of points) was the conversion of the problem of searching the neighbourhood in space (3D) into searching on a plane (2D); to this end, an algorithm was designed which is based on the application of coordinates recalculated into slope lengths, horizontal directions and zenith angles in the local coordinate system of the scanner. To make this procedure usable, untransformed data must be smoothed. The testing of the method usability was made as comparison of smoothed and reference objects.
  • The data obtained by 3D scanners with required higher accuracy and density contain disturbing noise, this noise makes the data processing, mainly by means of triangulated irregular networks using automated procedures, more complicated. The paper presents a new method of noise reduction based on natural redundancy of continuous objects and surfaces where, however, some deformation of the object shape occurs. The method involves a gradual choice of a selected number of the nearest points for each point of a scan, a selected surface is fitted with them and by the elongation or shortening of a beam with a given horizontal direction and the zenith angle onto the intersection with the surface a new (smoothed) position of the points is obtained. As the surface for fitting are used plane, polynomials of 2nd, 3rd and 4th degree. For the better calculation stability Chebyshev bivariant orthogonal polynomials are used. These surfaces are complemented by method using the mean. The solution of surface fitting may apply the least squares method with uniform weights or weights depending on distance, but also a robust method – the minimisation of the sum of absolute values of corrections (L1 norm). In spite of being always obtained in a certain order during the measurement, scanning data do not preserve this arrangement after their export, therefore, the procedure chosen for the searching of the neighbourhood of a point in a large point cloud (hundreds of thousands to millions of points) was the conversion of the problem of searching the neighbourhood in space (3D) into searching on a plane (2D); to this end, an algorithm was designed which is based on the application of coordinates recalculated into slope lengths, horizontal directions and zenith angles in the local coordinate system of the scanner. To make this procedure usable, untransformed data must be smoothed. The testing of the method usability was made as comparison of smoothed and reference objects. (en)
Title
  • 3d Scanner Point Cloud Denoising By Near Points Surface Fitting
  • 3d Scanner Point Cloud Denoising By Near Points Surface Fitting (en)
skos:prefLabel
  • 3d Scanner Point Cloud Denoising By Near Points Surface Fitting
  • 3d Scanner Point Cloud Denoising By Near Points Surface Fitting (en)
skos:notation
  • RIV/68407700:21110/13:00205795!RIV14-MSM-21110___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • S
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 119800
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21110/13:00205795
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • laser scanning; 3D scanning; denoising (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [7C9F9F69E047]
http://linked.open...v/mistoKonaniAkce
  • Munich
http://linked.open...i/riv/mistoVydani
  • Bellingham (stát Washington)
http://linked.open...i/riv/nazevZdroje
  • Videometrics, Range Imaging and Applications XII; and Automated Visual Inspection
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Smítka, Václav
  • Štroner, Martin
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000323508900009
http://linked.open.../riv/zahajeniAkce
issn
  • 0277-786X
number of pages
http://bibframe.org/vocab/doi
  • 10.1117/12.2020254
http://purl.org/ne...btex#hasPublisher
  • SPIE
https://schema.org/isbn
  • 978-0-8194-9607-2
http://localhost/t...ganizacniJednotka
  • 21110
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software