Toward better boundary preserved supervoxel segmentation for 3D point clouds
The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Abstract
Abstract Supervoxels provide a more natural and compact representation of three dimensional point clouds, and enable the operations to be performed on regions rather than on the scattered points. Many state-of-the-art supervoxel segmentation methods adopt fixed resolution for each supervoxel, and rely on the initialization of seed points. As a result, they may not preserve well the boundaries of the point cloud with a non-uniform density. In this paper, we present a simple but effective supervoxel segmentation method for point clouds, which formalizes supervoxel segmentation as a subset selection problem. We develop an heuristic algorithm that utilizes local information to efficiently solve the subset selection problem. The proposed method can produce supervoxels with adaptive resolutions, and dose not rely the selection of seed points. The method is fully tested on three publicly available point cloud segmentation benchmarks, which cover the major point cloud types. The experimental results show that compared with the state-of-the-art supervoxel segmentation methods, the supervoxels extracted using our method preserve the object boundaries and small structures more effectively, which is reflected in a higher boundary recall and lower under-segmentation error.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
SLIC Superpixels Compared to State-of-the-Art Superpixel Methods
Achanta, R., Shaji, A., Smith, K., Lucchi, A., Fua, P., & Süsstrunk, S. (2012) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.120 · Cited by 9,201 · cited 4×
“VCCS obtains the initial seed points by uniformly partitioning the 3D space, and adopts a local K-means method to extract the su-pervoxels on the basis of initial seed points.”
InfluentialMartin, D., Fowlkes, C., Tal, D., & Malik, J. (2002) · Proceedings Eighth IEEE International Conference on Computer Vision. ICCV 2001 · doi:10.1109/iccv.2001.937655 · Cited by 8,216 · cited 6×
“Martin et al. (2001) de fi ne the error between ground truth annotation G i and supervoxel S j as Similarity, the error between supervoxel S i and ground truth annotation G j is de fi ned as And the total intersection between ground truth and supervoxels is computed by Then, GCE is de fi ned as The…”
InfluentialIndoor segmentation and support inference from rgbd images
Silberman, N., Hoiem, D., Kohli, P., & Fergus, R. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-33715-4_54 · Cited by 5,760 · cited 1×
“For indoor scenes, we adopted NYU Depth Dataset V2 (Silberman et al., 2012).”
3D is here: Point Cloud Library (PCL)
Rusu, R. B., & Cousins, S. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980567 · Cited by 4,885 · cited 3×
“For comparison, we implemented the VCCS method according to the public source code in PCL (Rusu and Cousins, 2011).”
InfluentialEntropy rate superpixel segmentation
Liu, M.-Y., Tuzel, O., Ramalingam, S., & Chellappa, R. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995323 · Cited by 1,026 · cited 2×
“Unlike superpixel segmentation, which is already a well studied topic in image processing (Moore et al., 2008; Veksler et al., 2010; Liu et al., 2011; Bergh et al., 2013), supervoxel segmentation remains in the development stage.”
Image smoothing via L0gradient minimization
Xu, L., Lu, C., Xu, Y., & Jia, J. (2011) · Proceedings of the 2011 SIGGRAPH Asia Conference · doi:10.1145/2024156.2024208 · Cited by 873 · cited 1×
“Inspired by Nguyen and Brown (2015) and Xu et al. (2011), we adopt an adaptive strategy to automatically evaluate the value of λ .”
Image smoothing via L0gradient minimization
Xu, L., Lu, C., Xu, Y., & Jia, J. (2011) · ACM Transactions on Graphics · doi:10.1145/2070781.2024208 · Cited by 786
Voxel Cloud Connectivity Segmentation - Supervoxels for Point Clouds
Papon, J., Abramov, A., Schoeler, M., & Worgotter, F. (2013) · 2013 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2013.264 · Cited by 545 · cited 5×
“On the other hand, some faster approximation strategies, such as local K-means (Achanta et al., 2012; Papon et al., 2013), rely on the initialization of seed super-voxel points.”
InfluentialSuperpixels and Supervoxels in an Energy Optimization Framework
Veksler, O., Boykov, Y., & Mehrani, P. (2010) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-15555-0_16 · Cited by 443 · cited 2×
“Unlike superpixel segmentation, which is already a well studied topic in image processing (Moore et al., 2008; Veksler et al., 2010; Liu et al., 2011; Bergh et al., 2013), supervoxel segmentation remains in the development stage.”
Moore, A. P., Prince, S. J. D., Warrell, J., Mohammed, U., & Jones, G. (2008) · 2008 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2008.4587471 · Cited by 380 · cited 3×
“Unlike superpixel segmentation, which is already a well studied topic in image processing (Moore et al., 2008; Veksler et al., 2010; Liu et al., 2011; Bergh et al., 2013), supervoxel segmentation remains in the development stage.”
Cited by
Linking Points With Labels in 3D: A Review of Point Cloud Semantic Segmentation
Xie, Y., Tian, J., & Zhu, X. X. (2020) · IEEE Geoscience and Remote Sensing Magazine · doi:10.1109/mgrs.2019.2937630 · Cited by 482
Metadata
- Authors
- Lin, Y., Wang, C., Zhai, D., Li, W., & Li, J.
- Venue
- ISPRS Journal of Photogrammetry and Remote Sensing
- Publisher
- Elsevier BV
- Published
- 2018-09
- Volume
- 143
- Pages
- 39-47
- ISSN
- 0924-2716 (ISSN-L)
- OpenAlex
- W2804872164
- Cited by
- 178
- References
- 18
- FWCI
- 12.34
- Type
- journal article
- Language
- en
- Open access
- closed
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
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.