Remote-Sensed LIDAR Using Random Sampling and Sparse Reconstruction
dc.contributor.advisor | Creusere, Charles D. | en |
dc.contributor.author | Martinez, Juan Enrique Castorera | |
dc.date.accessioned | 2016-02-05T18:12:56Z | en |
dc.date.available | 2016-02-05T18:12:56Z | en |
dc.date.issued | 2011-10 | en |
dc.identifier.issn | 0884-5123 | en |
dc.identifier.issn | 0074-9079 | en |
dc.identifier.uri | http://hdl.handle.net/10150/595760 | en |
dc.description | ITC/USA 2011 Conference Proceedings / The Forty-Seventh Annual International Telemetering Conference and Technical Exhibition / October 24-27, 2011 / Bally's Las Vegas, Las Vegas, Nevada | en_US |
dc.description.abstract | In this paper, we propose a new, low complexity approach for the design of laser radar (LIDAR) systems for use in applications in which the system is wirelessly transmitting its data from a remote location back to a command center for reconstruction and viewing. Specifically, the proposed system collects random samples in different portions of the scene, and the density of sampling is controlled by the local scene complexity. The range samples are transmitted as they are acquired through a wireless communications link to a command center and a constrained absolute-error optimization procedure of the type commonly used for compressive sensing/sampling is applied. The key difficulty in the proposed approach is estimating the local scene complexity without densely sampling the scene and thus increasing the complexity of the LIDAR front end. We show here using simulated data that the complexity of the scene can be accurately estimated from the return pulse shape using a finite moments approach. Furthermore, we find that such complexity estimates correspond strongly to the surface reconstruction error that is achieved using the constrained optimization algorithm with a given number of samples. | |
dc.description.sponsorship | International Foundation for Telemetering | en |
dc.language.iso | en_US | en |
dc.publisher | International Foundation for Telemetering | en |
dc.relation.url | http://www.telemetry.org/ | en |
dc.rights | Copyright © held by the author; distribution rights International Foundation for Telemetering | en |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Compressive Sensing | en |
dc.subject | Sparse Signal Reconstruction | en |
dc.subject | LIDAR data modeling | en |
dc.subject | LIDAR data transmission | en |
dc.title | Remote-Sensed LIDAR Using Random Sampling and Sparse Reconstruction | en_US |
dc.type | text | en |
dc.type | Proceedings | en |
dc.contributor.department | New Mexico State University | en |
dc.identifier.journal | International Telemetering Conference Proceedings | en |
dc.description.collectioninformation | Proceedings from the International Telemetering Conference are made available by the International Foundation for Telemetering and the University of Arizona Libraries. Visit http://www.telemetry.org/index.php/contact-us if you have questions about items in this collection. | en |
refterms.dateFOA | 2018-09-11T04:50:48Z | |
html.description.abstract | In this paper, we propose a new, low complexity approach for the design of laser radar (LIDAR) systems for use in applications in which the system is wirelessly transmitting its data from a remote location back to a command center for reconstruction and viewing. Specifically, the proposed system collects random samples in different portions of the scene, and the density of sampling is controlled by the local scene complexity. The range samples are transmitted as they are acquired through a wireless communications link to a command center and a constrained absolute-error optimization procedure of the type commonly used for compressive sensing/sampling is applied. The key difficulty in the proposed approach is estimating the local scene complexity without densely sampling the scene and thus increasing the complexity of the LIDAR front end. We show here using simulated data that the complexity of the scene can be accurately estimated from the return pulse shape using a finite moments approach. Furthermore, we find that such complexity estimates correspond strongly to the surface reconstruction error that is achieved using the constrained optimization algorithm with a given number of samples. |