2001
DOI: 10.1109/36.898675
|View full text |Cite
|
Sign up to set email alerts
|

Object detection using high resolution near-field array processing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
9
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
7
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 17 publications
(9 citation statements)
references
References 8 publications
0
9
0
Order By: Relevance
“…Approaches devoted to the localization and shaping of targets have also been reported. As an example, a technique belonging to this class has been presented in [57]- [59]. The positions of buried targets are detected by estimating the scattered field directions of arrival through subarrays processing followed by a statistical filtering and a triangularization technique.…”
Section: Qualitative Approaches and Sampling Methodsmentioning
confidence: 99%
“…Approaches devoted to the localization and shaping of targets have also been reported. As an example, a technique belonging to this class has been presented in [57]- [59]. The positions of buried targets are detected by estimating the scattered field directions of arrival through subarrays processing followed by a statistical filtering and a triangularization technique.…”
Section: Qualitative Approaches and Sampling Methodsmentioning
confidence: 99%
“…). The synergy between signal processing and electromagnetic areas was introduced several years ago in many works, as in Bruckstein and Kailath () and Şahin and Miller ().…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, we present a statistical approach to process the data calculated by a forward scattering solver, in order to find an estimation for the position of an object using a sub‐array processing technique (Bouvet and Bienvenu ; Krim and Viberg ) similar to the one presented in Şahin and Miller (). Moreover, sub‐array processing techniques have been considered in order to achieve localization also for objects in the proximity of the array (Schmidt ).…”
Section: Introductionmentioning
confidence: 99%
“…Starer and Nehorai [8] reduced the computational complexity of the bearing-range estimation by the use of path following, but this method is limited to uniform linear arrays (ULAs). Sahin and Miller [9] partitioned the receiver array into subarrays, where the scattered fields are assumed to be locally planar, and a classical MUSIC algorithm is then used to estimate the DOAs, the range being estimated by a triangulation method. Weiss and Friedlander [10] reduced the computational cost of bearing-range estimation by replacing the two-dimensional (2-D) minimization of the 2-D MUSIC cost function by a 2-D polynomial rooting (see [11] for the extension of the method to the three-dimensional case).…”
Section: Introductionmentioning
confidence: 99%