# A Maximum Likelihood Approach to Extract Finite Planes from 3-D Laser Scans

Source: [A Maximum Likelihood Approach to Extract Finite Planes from 3-D Laser Scans](<https://www.sota2.com/research/paper/68fa668f1e209131cea10d06>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T21:52:21.192Z

Authors: Alexander Schaefer, Johan Vertens, Daniel B\\"uscher, Wolfram Burgard

Published: 2019-10-23T13:06:34.000Z

## Abstract

Whether it is object detection, model reconstruction, laser odometry, or point cloud registration: Plane extraction is a vital component of many robotic systems. In this paper, we propose a strictly probabilistic method to detect finite planes in organized 3-D laser range scans. An agglomerative hierarchical clustering technique, our algorithm builds planes from bottom up, always extending a plane by the point that decreases the measurement likelihood of the scan the least. In contrast to most related methods, which rely on heuristics like orthogonal point-to-plane distance, we leverage the ray path information to compute the measurement likelihood. We evaluate our approach not only on the popular SegComp benchmark, but also provide a challenging synthetic dataset that overcomes SegComp's deficiencies. Both our implementation and the suggested dataset are available at www.github.com/acschaefer/ppe.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1910.11146>)

[PDF](<https://arxiv.org/pdf/1910.11146.pdf>)
