Non-associative higher-order markov networks for point cloud classification

46Citations
Citations of this article
42Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, we introduce a non-associative higher-order graphical model to tackle the problem of semantic labeling of 3D point clouds. For this task, existing higher-order models overlook the relationships between the different classes and simply encourage the nodes in the cliques to have consistent labelings. We address this issue by devising a set of non-associative context patterns that describe higher-order geometric relationships between different class labels within the cliques. To this end, we propose a method to extract informative cliques in 3D point clouds that provide more knowledge about the context of the scene. We evaluate our approach on three challenging outdoor point cloud datasets. Our experiments evidence the benefits of our non-associative higher-order Markov networks over state-of-the-art point cloud labeling techniques. © 2014 Springer International Publishing.

Cite

CITATION STYLE

APA

Najafi, M., Taghavi Namin, S., Salzmann, M., & Petersson, L. (2014). Non-associative higher-order markov networks for point cloud classification. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8693 LNCS, pp. 500–515). Springer Verlag. https://doi.org/10.1007/978-3-319-10602-1_33

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free