The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
FAST SEMANTIC SEGMENTATION OF 3D POINT CLOUDS WITH STRONGLY VARYING DENSITY
Open accessAbstract
Abstract. We describe an effective and efficient method for point-wise semantic classification of 3D point clouds. The method can handle unstructured and inhomogeneous point clouds such as those derived from static terrestrial LiDAR or photogammetric reconstruction; and it is computationally efficient, making it possible to process point clouds with many millions of points in a matter of minutes. The key issue, both to cope with strong variations in point density and to bring down computation time, turns out to be careful handling of neighborhood relations. By choosing appropriate definitions of a point’s (multi-scale) neighborhood, we obtain a feature set that is both expressive and fast to compute. We evaluate our classification method both on benchmark data from a mobile mapping platform and on a variety of large, terrestrial laser scans with greatly varying point density. The proposed feature set outperforms the state of the art with respect to per-point classification accuracy, while at the same time being much faster to compute.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Shape matching and object recognition using shape contexts
Belongie, S., Malik, J., & Puzicha, J. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.993558 · Cited by 6,306
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
FAST APPROXIMATE NEAREST NEIGHBORS WITH AUTOMATIC ALGORITHM CONFIGURATION
(2009) · Proceedings of the Fourth International Conference on Computer Vision Theory and Applications · doi:10.5220/0001787803310340 · Cited by 2,640
Using spin images for efficient object recognition in cluttered 3D scenes
Johnson, A. E., & Hebert, M. (1999) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.765655 · Cited by 2,599
Efficient RANSAC for Point‐Cloud Shape Detection
Schnabel, R., Wahl, R., & Klein, R. (2007) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2007.01016.x · Cited by 2,106
He, K., Sun, J., & Tang, X. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15549-9_1 · Cited by 1,565
Unique Signatures of Histograms for Local Surface Description
Tombari, F., Salti, S., & Di Stefano, L. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15558-1_26 · Cited by 1,480
Recognizing Objects in Range Data Using Regional Point Descriptors
Frome, A., Huber, D., Kolluri, R., Bülow, T., & Malik, J. (2004) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-24672-5_18 · Cited by 885
Brodu, N., & Lague, D. (2012) · ISPRS Journal of Photogrammetry and Remote Sensing · doi:10.1016/j.isprsjprs.2012.01.006 · Cited by 633
Multi‐scale Feature Extraction on Point‐Sampled Surfaces
Pauly, M., Keiser, R., & Gross, M. (2003) · Computer Graphics Forum · doi:10.1111/1467-8659.00675 · Cited by 560
Cited by
RandLA-Net: Efficient Semantic Segmentation of Large-Scale Point Clouds
Hu, Q., Yang, B., Xie, L., Rosa, S., Guo, Y., Wang, Z., Trigoni, N., & Markham, A. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.01112 · Cited by 2,275
Large-Scale Point Cloud Semantic Segmentation with Superpoint Graphs
Landrieu, L., & Simonovsky, M. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00479 · Cited by 1,543
FoldingNet: Point Cloud Auto-Encoder via Deep Grid Deformation
Yang, Y., Feng, C., Shen, Y., & Tian, D. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00029 · Cited by 1,313
SEGCloud: Semantic Segmentation of 3D Point Clouds
Tchapmi, L., Choy, C., Armeni, I., Gwak, J., & Savarese, S. (2017) · 2017 International Conference on 3D Vision (3DV) · doi:10.1109/3dv.2017.00067 · Cited by 826
A REVIEW OF POINT CLOUDS SEGMENTATION AND CLASSIFICATION ALGORITHMS
Grilli, E., Menna, F., & Remondino, F. (2017) · The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences · doi:10.5194/isprs-archives-xlii-2-w3-339-2017 · Cited by 440
Metadata
- Authors
- Hackel, T., Wegner, J. D., & Schindler, K.
- Venue
- ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences
- Publisher
- Copernicus GmbH
- Published
- 2016-06-03
- Volume
- III-3
- Pages
- 177-184
- ISSN
- 2194-9042 (ISSN-L)
- 2194-9050
- OpenAlex
- W2473418274
- Cited by
- 371
- References
- 30
- FWCI
- 36.56
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: FAST SEMANTIC SEGMENTATION OF 3D POINT CLOUDS WITH STRONGLY VARYING DENSITY. https://app.cochat.ai/papers/10.5194/isprs-annals-iii-3-177-2016
- The paper
- Hackel, T., Wegner, J. D., & Schindler, K. (2016). FAST SEMANTIC SEGMENTATION OF 3D POINT CLOUDS WITH STRONGLY VARYING DENSITY. ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences. https://doi.org/10.5194/isprs-annals-iii-3-177-2016
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.