The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Fast Resampling of Three-Dimensional Point Clouds via Graphs
Open accessAbstract
To reduce the cost of storing, processing, and visualizing a large-scale point cloud, we propose a randomized resampling strategy that selects a representative subset of points while preserving application-dependent features. The strategy is based on graphs, which can represent underlying surfaces and lend themselves well to efficient computation. We use a general feature-extraction operator to represent application-dependent features and propose a general reconstruction error to evaluate the quality of resampling; by minimizing the error, we obtain a general form of optimal resampling distribution. The proposed resampling distribution is guaranteed to be shift-, rotation- and scale-invariant in the three-dimensional space. We then specify the feature-extraction operator to be a graph filter and study specific resampling strategies based on all-pass, low-pass, high-pass graph filtering and graph filter banks. We validate the proposed methods on three applications: Large-scale visualization, accurate registration, and robust shape modeling demonstrating the effectiveness and efficiency of the proposed resampling methods.
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
Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013) · IEEE Signal Processing Magazine · doi:10.1109/msp.2012.2235192 · Cited by 4,421
Discrete Signal Processing on Graphs
Sandryhaila, A., & Moura, J. M. F. (2013) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2013.2238935 · Cited by 1,531 · cited 2×
“Every linear, shift-invariant graph filter is a polynomial in the graph shift [32] where h (cid:96) ( (cid:96) = 0 , 1 , . . . , L − 1) are filter coefficients and L is the length of this graph filter.”
BackgroundMethodDiscrete Signal Processing on Graphs: Sampling Theory
Chen, S., Varma, R., Sandryhaila, A., & Kovacevic, J. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2469645 · Cited by 666
Self-citation
Cited by
Graph Signal Processing: Overview, Challenges, and Applications
Ortega, A., Frossard, P., Kovačević, J., Moura, J. M. F., & Vandergheynst, P. (2018) · Proceedings of the IEEE · doi:10.1109/jproc.2018.2820126 · Cited by 1,787
Actional-Structural Graph Convolutional Networks for Skeleton-Based Action Recognition
Li, M., Chen, S., Chen, X., Zhang, Y., Wang, Y., & Tian, Q. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00371 · Cited by 1,230
Self-citationPUFA-GAN: A Frequency-Aware Generative Adversarial Network for 3D Point Cloud Upsampling
Liu, H., Yuan, H., Hou, J., Hamzaoui, R., & Gao, W. (2022) · IEEE Transactions on Image Processing · doi:10.1109/tip.2022.3222918 · Cited by 339
Chen, S., Liu, B., Feng, C., Vallespi-Gonzalez, C., & Wellington, C. (2021) · IEEE Signal Processing Magazine · doi:10.1109/msp.2020.2984780 · Cited by 258
Self-citation
Metadata
- Authors
- Chen, S., Tian, D., Feng, C., Vetro, A., & Kovacevic, J.
- Venue
- IEEE Transactions on Signal Processing
- Published
- 2018-02-01
- Volume
- 66
- Issue
- 3
- Pages
- 666-681
- ISSN
- 1053-587X (ISSN-L)
- 1941-0476
- OpenAlex
- W2591997370
- Cited by
- 183
- References
- 3
- FWCI
- 11.00
- Type
- journal article
- Language
- en
- Open access
- green
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.