K-D Bonsai: ISA-Extensions to Compress K-D Trees for Autonomous Driving Tasks
Pedro H. E. Becker, Jos\'e Mar\'ia Arnau, Antonio Gonz\'alez

TL;DR
K-D Bonsai is a memory-efficient technique for 3D point cloud processing in autonomous driving, using data compression and specialized CPU instructions to improve latency and energy use without sacrificing accuracy.
Contribution
The paper introduces K-D Bonsai, a novel compression method with CPU extensions that reduces memory usage and improves performance in point cloud radius searches for autonomous driving.
Findings
9.26% latency improvement
12.19% tail latency reduction
10.84% energy savings
Abstract
Autonomous Driving (AD) systems extensively manipulate 3D point clouds for object detection and vehicle localization. Thereby, efficient processing of 3D point clouds is crucial in these systems. In this work we propose K-D Bonsai, a technique to cut down memory usage during radius search, a critical building block of point cloud processing. K-D Bonsai exploits value similarity in the data structure that holds the point cloud (a k-d tree) to compress the data in memory. K-D Bonsai further compresses the data using a reduced floating-point representation, exploiting the physically limited range of point cloud values. For easy integration into nowadays systems, we implement K-D Bonsai through Bonsai-extensions, a small set of new CPU instructions to compress, decompress, and operate on points. To maintain baseline safety levels, we carefully craft the Bonsai-extensions to detect precision…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topics3D Shape Modeling and Analysis · Computer Graphics and Visualization Techniques · Graph Theory and Algorithms
