Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems 2017
DOI: 10.1145/3139958.3139969
|View full text |Cite
|
Sign up to set email alerts
|

Dictionary Compression in Point Cloud Data Management

Abstract: Nowadays, massive amounts of point cloud data can be collected thanks to advances in data acquisition and processing technologies like dense image matching and airborne LiDAR (Light Detection and Ranging) scanning. With the increase in volume and precision, point cloud data offers a useful source of information for natural resource management, urban planning, self-driving cars and more. At the same time, the scale at which point cloud data is produced, introduces management challenges: it is important to achie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
4
3

Relationship

1
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 23 publications
0
3
0
Order By: Relevance
“…As the Morton is too discrete, an optimization algorithm for the Morton is proposed by IT on this basis finally [3]. Mirjana et al, introduced space-filling curve dictionary-based compression, employs dictionary-based compression in the spatial data management domain and enhances it with indexing capabilities by using space-filling curves [4]. Javier et al, used a fast variant of Gaussian Mixture Models and an expectation-Maximization algorithm to replace the points grouped in the previous step with a set of Gaussian distributions.…”
Section: A Point Cloud Compressionmentioning
confidence: 99%
“…As the Morton is too discrete, an optimization algorithm for the Morton is proposed by IT on this basis finally [3]. Mirjana et al, introduced space-filling curve dictionary-based compression, employs dictionary-based compression in the spatial data management domain and enhances it with indexing capabilities by using space-filling curves [4]. Javier et al, used a fast variant of Gaussian Mixture Models and an expectation-Maximization algorithm to replace the points grouped in the previous step with a set of Gaussian distributions.…”
Section: A Point Cloud Compressionmentioning
confidence: 99%
“…However, its encoding/decoding performance is lower than the constant-type code. In [17], Pavlovic proposed a compression method for point cloud data using the SFC. The method is based on a static space and a distribution of coordinates for input point cloud data.…”
Section: B Space Filling Curvesmentioning
confidence: 99%
“…They have also been used to reduce I/O access times by reducing the number of disk seeks necessary for range queries [1] or improving disk address prediction from disk indices [4]. SFCs have shown promise in large point-data management software, for both data compression and access [5], [6]. Given their locality preservation properties, SFCs are effective at improving k nearest-neighbour queries [7], [8], [9], [10].…”
Section: Introductionmentioning
confidence: 99%