Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mohamed Boussaha

dblp:239/4297 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2019
0000-0003-2145-790XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
3D vision · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer vision › 3D vision
point cloud analysis
0.412019
Point Cloud Oversegmentation With Graph-Structured Deep Metric Learning · CVPR 2019
Computer vision › 3D vision › point cloud segmentation
point cloud oversegmentation
0.412019
Point Cloud Oversegmentation With Graph-Structured Deep Metric Learning · CVPR 2019
Computer vision › 3D vision › local feature descriptor
superpoint
0.112019
Point Cloud Oversegmentation With Graph-Structured Deep Metric Learning · CVPR 2019

Methods — techniques the papers use, named apart from their topics

neural network · 0.4graph partitioning · 0.4deep metric learning · 0.4
YearPublicationVenuePosition
2019 Point Cloud Oversegmentation With Graph-Structured Deep Metric Learning
abstract
We propose a new supervized learning framework for oversegmenting 3D point clouds into superpoints. We cast this problem as learning deep embeddings of the local geometry and radiometry of 3D points, such that the border of objects presents high contrasts. The embeddings are computed using a lightweight neural network operating on the points' local neighborhood. Finally, we formulate point cloud oversegmentation as a graph partition problem with respect to the learned embeddings. This new approach allows us to set a new state-of-the-art in point cloud oversegmentation by a significant margin, on a dense indoor dataset (S3DIS) and a sparse outdoor one (vKITTI). Our best solution requires over five times fewer superpoints to reach similar performance than previously published methods on S3DIS. Furthermore, we show that our framework can be used to improve superpoint-based semantic segmentation algorithms, setting a new state-of-the-art for this task as well.
Loïc Landrieu, Mohamed Boussaha
CVPR2