TU Darmstadt / ULB / TUbiblio

Linear Algorithms in Sublinear Time - a Tutorial on Statistical Estimation

Ullrich, Torsten and Fellner, Dieter W. (2011):
Linear Algorithms in Sublinear Time - a Tutorial on Statistical Estimation.
In: IEEE Computer Graphics and Applications, 31 (2), pp. 58-66. DOI: 10.1109/MCG.2010.21,
[Article]

Abstract

This tutorial presents probability theory techniques for boosting linear algorithms. The approach is based on statistics and uses educated guesses instead of comprehensive calculations. Because estimates can be calculated in sublinear time, many algorithms can benefit from statistical estimation. Several examples show how to significantly boost linear algorithms without negative effects on their results. These examples involve a Ransac algorithm, an image-processing algorithm, and a geometrical reconstruction. The approach exploits that, in many cases, the amount of information in a dataset increases asymptotically sublinearly if its size or sampling density increases. Conversely, an algorithm with expected sublinear running time can extract the most information.

Item Type: Article
Erschienen: 2011
Creators: Ullrich, Torsten and Fellner, Dieter W.
Title: Linear Algorithms in Sublinear Time - a Tutorial on Statistical Estimation
Language: English
Abstract:

This tutorial presents probability theory techniques for boosting linear algorithms. The approach is based on statistics and uses educated guesses instead of comprehensive calculations. Because estimates can be calculated in sublinear time, many algorithms can benefit from statistical estimation. Several examples show how to significantly boost linear algorithms without negative effects on their results. These examples involve a Ransac algorithm, an image-processing algorithm, and a geometrical reconstruction. The approach exploits that, in many cases, the amount of information in a dataset increases asymptotically sublinearly if its size or sampling density increases. Conversely, an algorithm with expected sublinear running time can extract the most information.

Journal or Publication Title: IEEE Computer Graphics and Applications
Journal volume: 31
Number: 2
Uncontrolled Keywords: Forschungsgruppe Semantic Models, Immersive Systems (SMIS), Business Field: Virtual engineering, Research Area: Confluence of graphics and vision, Research Area: Semantics in the modeling process, Computer graphics, Algorithms, Statistics, Optimization, Statistical computing, Algorithm boosting
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Interactive Graphics Systems
Date Deposited: 12 Nov 2018 11:16
DOI: 10.1109/MCG.2010.21
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details