Novel compression algorithm based on sparse sampling of 3-D laser range scans

dc.citation.epage870en_US
dc.citation.issueNumber7en_US
dc.citation.spage852en_US
dc.citation.volumeNumber56en_US
dc.contributor.authorDobrucali, O.en_US
dc.contributor.authorBarshan, B.en_US
dc.date.accessioned2016-02-08T09:37:48Z
dc.date.available2016-02-08T09:37:48Z
dc.date.issued2013en_US
dc.departmentDepartment of Electrical and Electronics Engineeringen_US
dc.description.abstractThree-dimensional models of environments can be very useful and are commonly employed in areas such as robotics, art and architecture, facility management, water management, environmental/industrial/urban planning and documentation. A 3-D model is typically composed of a large number of measurements. When 3-D models of environments need to be transmitted or stored, they should be compressed efficiently to use the capacity of the communication channel or the storage medium effectively. We propose a novel compression technique based on compressive sampling applied to sparse representations of 3-D laser range measurements. The main issue here is finding highly sparse representations of the range measurements, since they do not have such representations in common domains, such as the frequency domain. To solve this problem, we develop a new algorithm to generate sparse innovations between consecutive range measurements acquired while the sensor moves. We compare the sparsity of our innovations with others generated by estimation and filtering. Furthermore, we compare the compression performance of our lossy compression method with widely used lossless and lossy compression techniques. The proposed method offers a small compression ratio and provides a reasonable compromise between the reconstruction error and processing time. © 2012 The Author 2012. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T09:37:48Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2013en
dc.identifier.doi10.1093/comjnl/bxs050en_US
dc.identifier.issn0010-4620
dc.identifier.urihttp://hdl.handle.net/11693/20908
dc.language.isoEnglishen_US
dc.publisherOxford University Pressen_US
dc.relation.isversionofhttp://dx.doi.org/10.1093/comjnl/bxs050en_US
dc.source.titleComputer Journalen_US
dc.subject3-D laser range measurementen_US
dc.subject3-D modelingen_US
dc.subject3-D mappingen_US
dc.subjectCompression algorithmsen_US
dc.subjectIntelligent sensorsen_US
dc.subjectLaser range findersen_US
dc.subjectLaser range measurementsen_US
dc.subjectRobot sensing systemen_US
dc.subjectSensor systemsen_US
dc.subjectAlgorithmsen_US
dc.subjectCompressed sensingen_US
dc.subjectCompression ratio (machinery)en_US
dc.subjectData compressionen_US
dc.subjectOffice buildingsen_US
dc.subjectRobot programmingen_US
dc.subjectSensorsen_US
dc.subjectThree dimensional computer graphicsen_US
dc.subjectWater managementen_US
dc.subjectThree dimensionalen_US
dc.titleNovel compression algorithm based on sparse sampling of 3-D laser range scansen_US
dc.typeArticleen_US

Files

Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Novel compression algorithm based on sparse sampling of 3-d laser range scans.pdf
Size:
903.85 KB
Format:
Adobe Portable Document Format
Description:
Full Printable Version