[-] Show simple item record

dc.contributor.advisorZhu, Li
dc.contributor.authorAinala, Karthik
dc.date.issued2017
dc.date.submitted2017 Fall
dc.descriptionTitle from PDF of title page viewed May 16, 2018
dc.descriptionThesis advisor: Zhu Li
dc.descriptionVita
dc.descriptionIncludes bibliographical references (page 25-26)
dc.descriptionThesis (M.S.)--School of Computing and Engineering. University of Missouri--Kansas City, 2017
dc.description.abstractWith the commoditization of the 3D depth sensors, we can now very easily model real objects and scenes into digital domain which then can be used for variety of application in gaming, animation, virtual reality, immersive communication etc. Modern sensors are capable of capturing objects with very high detail and scene of large area and thus might include millions of points. These point data usually occupy large storage space or require high bandwidth in case of real-time transmission. Thus, an efficient compression of these huge point cloud data points becomes necessary. Point clouds are often organized and compressed with octree based structures. The octree subdivision sequence is often serialized in a sequence of bytes that are subsequently entropy encoded using range coding, arithmetic coding or other methods. Such octree based algorithms are efficient only up to a certain level of detail as they have an exponential run-time in the number of subdivision levels. In addition, the compression efficiency diminishes when the number of subdivision levels increases. In this work we present an alternative way to partition the point cloud data. The point cloud is divided based on the data partition using kd tree binary division instead of Octree’s space partition method and forming a base layer. In base layer leaf nodes, the distribution of points is considered and projected to a 2D plane based on the flatness of the node points. Octree and Quadtree based partition is used to further convert the data to bitstreams. These are scalable point cloud bitstreams as we need only specific number of kd nodes in each time for a specific point of view. The use case is navigation in autonomous vehicles where it requires point cloud information up to a specific distance at different speeds. These scalable bitstreams of kd nodes can be used in real time transmission with low latency. Results show that compression performance is improved for geometry compression in point clouds and a scalable low latency streaming model is shown for navigation use case.eng
dc.description.tableofcontentsIntroduction -- Background -- Experimental and computational details -- Conclusion -- Appendix
dc.format.extentix, 27 pages
dc.identifier.urihttps://hdl.handle.net/10355/63254
dc.publisherUniversity of Missouri--Kansas Cityeng
dc.subject.lcshThree-dimensional modeling
dc.subject.lcshData compression (Computer science)
dc.subject.otherThesis -- University of Missouri--Kansas City -- Engineering
dc.titlePoint Cloud Compression and Low Latency Streamingeng
dc.typeThesiseng
thesis.degree.disciplineElectrical Engineering (UMKC)
thesis.degree.grantorUniversity of Missouri--Kansas City
thesis.degree.levelMasters
thesis.degree.nameM.S.


Files in this item

[PDF]

This item appears in the following Collection(s)

[-] Show simple item record