Radar false alarm plots elimination based on multi-feature extraction and classification

Caused by the environment clutter,the radar false alarm plots are unavoidable.Suppressing false alarm points has always been a key issue in Radar plots procession.In this paper,a radar false alarm plots elimination method based on multi-feature extraction and classification is proposed to effectively eliminate false alarm plots.Firstly,the density based spatial clustering of applications with noise(DBSCAN)algorithm is used to cluster the radar echo data processed by constant false-alarm rate(CFAR).The multi-features including the scale features,time domain features and transform domain features are extracted.Secondly,a feature evaluation method combining pearson correlation coefficient(PCC)and entropy weight method(EWM)is proposed to evaluate interrelation among features,effective feature combination sets are selected as inputs of the classifier.Finally,False alarm plots classified as clutters are eliminated.The experimental results show that proposed method can eliminate about 90%false alarm plots with less target loss rate.

An Effective Density Based Approach to Detect Complex Data Clusters Using Notion of Neighborhood Difference

The density based notion for clustering approach is used widely due to its easy implementation and ability to detect arbitrary shaped clusters in the presence of noisy data points without requiring prior knowledge of the number of clusters to be identified. Density-based spatial clustering of applications with noise （DBSCAN） is the first algorithm proposed in the literature that uses density based notion for cluster detection. Since most of the real data set, today contains feature space of adjacent nested clusters, clearly DBSCAN is not suitable to detect variable adjacent density clusters due to the use of global density parameter neighborhood radius Y,.ad and minimum number of points in neighborhood Np~,. So the efficiency of DBSCAN depends on these initial parameter settings, for DBSCAN to work properly, the neighborhood radius must be less than the distance between two clusters otherwise algorithm merges two clusters and detects them as a single cluster. Through this paper： 1） We have proposed improved version of DBSCAN algorithm to detect clusters of varying density adjacent clusters by using the concept of neighborhood difference and using the notion of density based approach without introducing much additional computational complexity to original DBSCAN algorithm. 2） We validated our experimental results using one of our authors recently proposed space density indexing （SDI） internal cluster measure to demonstrate the quality of proposed clustering method. Also our experimental results suggested that proposed method is effective in detecting variable density adjacent nested clusters.