EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Multiple Targets CFAR Detection Performance Based on an Intelligent Clustering Algorithm in K-Distribution Sea Clutter

Mansoor M Al-Dabaa, Eugen Laslo, Ahmed A Emran, Ahmed Yahya, Ashraf Aboshosha iD

Sensors · 20.04.2025 · 25 (8) · 2613

DOI: 10.3390/s25082613 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 20.04.2025. Verfasst von Mansoor M Al-Dabaa und 4 weiteren Autor:innen. Beteiligte Einrichtung: Department of Electrical Engineering, Faculty of Engineering, Al-Azhar University, Cairo 11651, Egypt. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 35 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: University of Oradea.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Maintaining a Constant False Alarm Rate (CFAR) in the presence of K-distributed sea clutter is vital due to the dynamic and unpredictable nature of maritime environments. However, conventional CFAR detectors suffer significant performance degradation in multi-target scenarios, primarily due to the masking effect caused by interfering targets. To address this challenge, this paper introduces an advanced detection scheme that integrates Linear Density-Based Spatial Clustering for Applications with Noise (Lin-DBSCAN) with CFAR processing. Lin-DBSCAN is specifically tailored to efficiently identify and isolate interfering targets and sea spikes, which typically manifest as outliers in the symmetric reference windows surrounding the Cell Under Test (CUT). By leveraging Lin-DBSCAN, the proposed Lin-DBSCAN-CFAR method effectively filters out anomalous signals from the background clutter, resulting in enhanced detection accuracy and robustness, especially under complex sea clutter conditions. Extensive simulations under varying conditions, including multiple target environments, varying false alarm rates, and different clutter shape parameters, demonstrate that Lin-DBSCAN-CFAR significantly outperforms conventional CFAR approaches. It is noteworthy that the proposed method achieves detection performance comparable to the more computationally intensive DBSCAN-CFAR while significantly reducing computational complexity. Simulation results reveal that Lin-DBSCAN-CFAR requires a 1 to 2 dB lower SNR to reach a detection probability of 0.8 compared with the nearest traditional CFAR techniques, confirming its superiority in both accuracy and efficiency.

Schlagwörter

Stichwörter der Autor:innen

K-distribution sea cluttercell under testlinear density-based spatial clustering for applications with noisemultiple targetssea clutter

Autor:innen und Institutionen

  • Department of Electrical Engineering, Faculty of Engineering, Al-Azhar University, Cairo 11651, Egypt.
  • Department of Mathematics and Computer Science, Faculty of Science, University of Oradea, 410087 Oradea, Romania.
  • Radiation Engineering Department, National Center for Radiation Research and Technology (NCRRT), Egyptian Atomic Energy Authority (EAEA), Cairo 11371, Egypt.

ORCID-Profile: Ashraf Aboshosha

Förderung

  • University of Oradea

Zitieren

APA

Al-Dabaa, M. M., Laslo, E., Emran, A. A., Yahya, A., & Aboshosha, A. (2025). Multiple Targets CFAR Detection Performance Based on an Intelligent Clustering Algorithm in K-Distribution Sea Clutter. Sensors, 25(8), 2613. https://doi.org/10.3390/s25082613

Vancouver

Al-Dabaa MM, Laslo E, Emran AA, Yahya A, Aboshosha A. Multiple Targets CFAR Detection Performance Based on an Intelligent Clustering Algorithm in K-Distribution Sea Clutter. Sensors. 2025;25(8):2613. doi:10.3390/s25082613

BibTeX
@article{AlDabaa2025,
  author = {Al-Dabaa, Mansoor M and Laslo, Eugen and Emran, Ahmed A and Yahya, Ahmed and Aboshosha, Ashraf},
  title = {Multiple Targets CFAR Detection Performance Based on an Intelligent Clustering Algorithm in K-Distribution Sea Clutter},
  journal = {Sensors},
  year = {2025},
  volume = {25},
  number = {8},
  pages = {2613},
  doi = {10.3390/s25082613}
}
Kostenlos starten →