Graph-Based Maximum Connected-Component Learning Algorithm for Small Target Detection in Maritime Radars

Anomaly detection needs to learn one-class classifiers from normal instances in observation or feature spaces. In the Neyman–Pearson criterion, the design of one-class classifiers boils down to finding the minimal-volume decision region subject to the error probability of normal instances no larger...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on aerospace and electronic systems Ročník 61; číslo 1; s. 250 - 265
Hlavní autoři: Bai, Xiaohui, Xu, Shuwen, Guo, Zixun, Shui, Penglang
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.02.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Anomalies
Anomaly detection
Classification algorithms
convexhull learning algorithm
Convexity
Detectors
False alarms
Feature extraction
feature-based detection
Graph theory
graph-based maximum connected-component (GMCC) learning algorithm
Level set
Machine learning
Probability density functions
Radar
sea-surface small target detection
Search algorithms
Signal processing algorithms
Target detection
Training
ISSN:0018-9251, 1557-9603
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Anomaly detection needs to learn one-class classifiers from normal instances in observation or feature spaces. In the Neyman–Pearson criterion, the design of one-class classifiers boils down to finding the minimal-volume decision region subject to the error probability of normal instances no larger than a desired false alarm rate. The theoretical solution to this design problem is the probability density function (pdf) level set of normal instances. In low-dimensional feature spaces, by combining training samples with the convexity regularity on decision regions, the convexhull learning algorithm is a technique for designing one-class classifiers. In order to overcome its dimension limitation and the mismatch of convexity to the level sets of a multimodal pdf, this article considers the approach to replace the convexity by the connectivity to regularize decision regions. A fast graph-based maximum connected-component learning algorithm is proposed to design one-class classifiers in high-dimensional feature spaces, which exploits the fast maximum connected-component search algorithm in a large-scale undirected graph. Moreover, for the application of sea-surface small target detection, the proposed algorithm combines ten-dimensional features to design feature-based detectors. Experimental results on the recognized radar database indicate the effectiveness of the proposed algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9251
1557-9603
DOI:10.1109/TAES.2024.3443786