Papers
Topics
Authors
Recent
Search
2000 character limit reached

3D planar patch extraction from stereo using probabilistic region growing

Published 27 Jun 2014 in cs.CV | (1406.7112v1)

Abstract: This article presents a novel 3D planar patch extraction method using a probabilistic region growing algorithm. Our method works by simultaneously initiating multiple planar patches from seed points, the latter determined by an intensity-based 2D segmentation algorithm in the stereo-pair images. The patches are grown incrementally and in parallel as 3D scene points are considered for membership, using a probabilistic distance likelihood measure. In addition, we have incorporated prior information based on the noise model in the 2D images and the scene configuration but also include the intensity information resulting from the initial segmentation. This method works well across many different data-sets, involving real and synthetic examples of both regularly and non-regularly sampled data, and is fast enough that may be used for robot navigation tasks of path detection and obstacle avoidance.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.