A performance analysis of two linear array processing algorithms for obstacle localization
buir.contributor.author | Arıkan, Orhan | |
buir.contributor.orcid | Arıkan, Orhan|0000-0002-3698-8888 | |
dc.citation.epage | 544 | en_US |
dc.citation.spage | 533 | en_US |
dc.citation.volumeNumber | 2561 | en_US |
dc.contributor.author | Arıkan, Orhan | en_US |
dc.contributor.author | Barshan, Billur | en_US |
dc.coverage.spatial | San Diego, California, U.S.A. | en_US |
dc.date.accessioned | 2016-02-08T12:01:04Z | en_US |
dc.date.available | 2016-02-08T12:01:04Z | en_US |
dc.date.issued | 1995 | en_US |
dc.department | Department of Electrical and Electronics Engineering | en_US |
dc.description | Date of Conference: 9-14 July 1995 | en_US |
dc.description | Conference Name: SPIE's 1995 International Symposium on Optical Science, Engineering, and Instrumentation, 1995 | en_US |
dc.description.abstract | The performance of a commonly employed linear array of sonar sensors is assessed for point- target localization. Two different methods of combining time-of-flight information from the sensors are described to estimate the range and azimuth of the target: pairwise estimate method and the maximum likelihood estimator. The biases and variances of the methods are investigated and their combined effect is compared to the Cramer-Rao Lower Bound. Simulation studies indicate that in estimating range, both methods perform comparably; in estimating azimuth, maximum likelihood estimate is superior at a cost of extra computation. | en_US |
dc.identifier.doi | 10.1117/12.217686 | en_US |
dc.identifier.issn | 0277-786X | en_US |
dc.identifier.uri | http://hdl.handle.net/11693/27758 | en_US |
dc.language.iso | English | en_US |
dc.publisher | SPIE | en_US |
dc.relation.isversionof | https://doi.org/10.1117/12.217686 | en_US |
dc.source.title | Proceedings of SPIE Vol. 2561, Signal and Data Processing of Small Targets, 1995 | en_US |
dc.subject | Acoustic sensors | en_US |
dc.subject | Array processing | en_US |
dc.subject | Target localization | en_US |
dc.subject | Maximum likelihood estimate | en_US |
dc.subject | Cramér-Rao Lower Bound | en_US |
dc.title | A performance analysis of two linear array processing algorithms for obstacle localization | en_US |
dc.type | Conference Paper | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Performance analysis of two linear array processing algorithms for obstacle localization.pdf
- Size:
- 380.13 KB
- Format:
- Adobe Portable Document Format
- Description:
- Full printable version