2018
DOI: 10.1109/jsen.2018.2853188
|View full text |Cite
|
Sign up to set email alerts
|

Greedy Algorithm-Based Track-Before-Detect in Radar Systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
10
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 17 publications
(10 citation statements)
references
References 23 publications
0
10
0
Order By: Relevance
“…The Gaussian noise model is generally used in passive radars as well [3][4][5][6][7][8][9][10][11][13][14][15][16]. However, these methods are not optimal in real world problems with non-Gaussian noise.…”
Section: Noise Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…The Gaussian noise model is generally used in passive radars as well [3][4][5][6][7][8][9][10][11][13][14][15][16]. However, these methods are not optimal in real world problems with non-Gaussian noise.…”
Section: Noise Modelmentioning
confidence: 99%
“…In [15], the downlink of the illuminator was simulated as a code-division multiple access (CDMA) modulation signal and the dynamic programming (DP) algorithm was used for the detection of a weak target echo. To overcome the high computational load of the DP TBD method, a greedy algorithm with similar performance to that DP TBD, but with lower computational load is proposed in [16].…”
Section: Introductionmentioning
confidence: 99%
“…It makes a locally optimal choice at each stage and then obtains a global optimal or suboptimal solution. It can achieve the same or similar performance with DP under some restrictions [31]. However, to achieve a good performance, the threshold determination is very complex, and the performance will decrease dramatically if the trace is composed of large gaps.…”
Section: Introductionmentioning
confidence: 98%
“…is work mainly focuses on the tracking of the time-Doppler and time-azimuth traces for targets in sight; however, the propagation environment, including the sea, land, and ionospheric propagation [10][11][12], is extremely complicated, which leads to a challenging problem due to unknown and varying number of multitarget, model mismatch, lower signal-to-noise ratio (SNR), hybrid clutter, severe breaking points, intersecting traces, etc. Typical TBD strategies include Kalman filter (KF) [13,14], Hough transform (HT) [15][16][17], velocity filtering (VF) [18][19][20][21], particle filtering (PF) [22][23][24][25], dynamic programming (DP) [26][27][28][29][30], and Greedy algorithm [31]. eir basic concept, possible advantages, and limitation for application related to this work are summarized as follows:…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation