Design of connected component analysis based clustering of CFAR image in pulse Doppler radars

In this paper we discuss the design of clustering scheme of CFAR image map to identify distinct targets present in the coherent processing interval (CPI). Detections out of a CFAR are conventionally grouped together using a fixed size window. This window scans over the set of detections and groups all those that lie in proximity to the peak detections. This clustering process is carried out till all detections lie in any one cluster, and each cluster is used for further processing. The major limitation of the approach comes from the use of fixed correlation window for clustering CFAR image. The process does not ensure the possibility that an extended return or two targets with overlapping returns are clustered and processed together. In this paper we propose the application of connected component labeling for clustering CFAR image to form final distinct detections. Connected component labeling is a classical algorithm used in image processing for segmentation of binary images. The algorithm groups pixels of a binary image based on 4 or 8 connectivity. Thus connected component analysis is most suitable algorithm for segmentation of CFAR image to identify distinct clusters or targets. The algorithm does not require the prior knowledge of number of clusters/targets present and the correlation window to form clusters. The modifications to the classical CCA algorithm is carried out to fold the Doppler edge to take care of periodic spectrum behavior in Doppler direction. The algorithm allows the clustering of range extended returns or overlapped target returns in to single cluster if the returns are connected. The valley detection algorithm is devised to identify the cause for extended range clusters. If the extended range cluster is formed the valley detection algorithm works on the return strength from the detected range cells and the trough in between indicates the returns are from two nearby range targets. This information is used to improve range resolution performance of the radar. The resulting scheme does not require a fixed window. The scheme provides for a robust method for clustering extended or arbitrary target returns on the CFAR map. Simulation studies have been carried out to evaluate the improvement achieved in resolving targets in range axis. The simulation studies show that the target return peaks separated by a range cell is resolvable as against conventional approach where in the peaks shall be separated by multiple range cells.

[1]  D.M. Mount,et al.  An Efficient k-Means Clustering Algorithm: Analysis and Implementation , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Saleem A. Kassam,et al.  Analysis of CFAR processors in homogeneous background , 1988 .

[3]  F. Harris On the use of windows for harmonic analysis with the discrete Fourier transform , 1978, Proceedings of the IEEE.

[4]  Peyton Z. Peebles,et al.  Fluctuating Target Detection in Clutter Using Sidelobe Blanking Logic , 1971, IEEE Transactions on Aerospace and Electronic Systems.

[5]  Donald G. Bailey,et al.  Optimised single pass connected components analysis , 2008, 2008 International Conference on Field-Programmable Technology.

[6]  Donald G. Bailey,et al.  Single Pass Connected Components Analysis , 2007 .

[7]  Hanan Samet,et al.  A general approach to connected-component labeling for arbitrary image representations , 1992, JACM.

[8]  Louis Maisel Performance of Sidelobe Blanking Systems , 1968, IEEE Transactions on Aerospace and Electronic Systems.

[9]  Saleem A. Kassam,et al.  Optimality of the cell averaging CFAR detector , 1994, IEEE Trans. Inf. Theory.