2017 · 56 citations · 13 references
ComputingVisualization3D ModelingComputational GeometryVolume Visualization3D Imaging3D ReconstructionData CompressionDigital Image ProcessingImage CompressionPoint Cloud Processing3D Data CompressionCompressionGraph LaplacianGraph Signal ProcessingLagrangian OptimizationPoint Cloud CompressionRate-distortion CodingRate-distortion Function
3D sensing and content capturing have made significant progress in recent years and the MPEG standardization organization is launching a new project on immersive media with point cloud compression (PCC) as one key corner stone. In this work, we introduce a new binary tree based point cloud partition and explore the graph signal processing tools, especially the graph transform with optimized Laplacian sparsity, to achieve better energy compaction and compression efficiency. The resulting rate-distortion operating points are convex-hull optimized over the existing Lagrangian solutions. Simulation results on the latest high quality point cloud content from the MPEG PCC demonstrate the transform efficiency and rate-distortion (R-D) optimal potential of the proposed solutions.
13
Multidimensional binary search trees used for associative searching
Jon Bentley · Communications of the ACM · 1975 · 7.5K citations · Full text
An efficient k-means clustering algorithm
Khaled Alsabti, Sanjay Ranka, Vineet Kumar Singh · 1997 · 494 citations · Full text
An efficient k′-means clustering algorithm
Krista Rizman Žalik · Pattern Recognition Letters · 2008 · 373 citations