Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Optimal estimation of line segments in noisy lidar data

From MaRDI portal
Publication:1031281
Jump to:navigation, search

DOI10.1016/J.SIGPRO.2005.10.016zbMATH Open1172.62305OpenAlexW1986200101MaRDI QIDQ1031281FDOQ1031281


Authors: Andreas Kapp, Lutz Gröll Edit this on Wikidata


Publication date: 29 October 2009

Published in: Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.sigpro.2005.10.016




Recommendations

  • Fitting a line segment to noisy data
  • scientific article; zbMATH DE number 2045480
  • scientific article; zbMATH DE number 549932
  • Analytic line fitting in the presence of uniform random noise
  • Comparison of the least squares and total least squares lines


zbMATH Keywords

maximum likelihoodleast squaresoptimal estimationtotal least squaresline fitting


Mathematics Subject Classification ID

Point estimation (62F10) Nonparametric estimation (62G05)



Cited In (5)

  • Volumetric uncertainty bounds and optimal configurations for converging beam triple LIDAR
  • Fitting a line segment to noisy data
  • A Marked Point Process for Modeling Lidar Waveforms
  • Estimation of linear target-layer trajectories using cluttered point cloud data
  • A denoising method for LiDAR full-waveform data





This page was built for publication: Optimal estimation of line segments in noisy lidar data

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1031281)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1031281&oldid=13033051"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 22:20. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki