Application Research on High Resolution Radar Target Aggregation

Full Text (PDF, 532KB), PP.1-7

Views: 0 Downloads: 0


Zhongzhi Li 1,* Xuegang Wang 1

1. School of Electronic Engineering, University of Electronic Science and Technology of China, Chengdu, China

* Corresponding author.


Received: 14 Apr. 2010 / Revised: 23 Jun. 2010 / Accepted: 1 Sep. 2010 / Published: 8 Nov. 2010

Index Terms

Target aggregation, high resolution radar, clustering, airport scene surveillance radar system, single dimensional distance


In high resolution radar system, the same target always has original data; so we need to merge multiple data from the same target as one target. Because of the system’s real-time requirement, we usually have to carry out target aggregation as quickly as possible. In this paper, we propose a quick target aggregation method based on clustering algorithm. The proposed method divides original data into subsets by single dimensional distance, and then merges subsets according to single dimensional distance and setdensity. At last we apply the proposed method to carry out target aggregation for airport scene surveillance radar system. Experimental result shows the proposed method has high execution efficiency and is not sensitive to noise data; it is useful for high resolution radar target aggregation.

Cite This Paper

Zhongzhi Li, Xuegang Wang,"Application Research on High Resolution Radar Target Aggregation", International Journal of Intelligent Systems and Applications(IJISA), vol.2, no.1, pp.1-7, 2010. DOI: 10.5815/ijisa.2010.01.01


[1] Lawrence A. Klein, “Sensor and data fusion: A tool for information assessment and decision making,” SPIE Press, 2004.

[2] Zhongzhi Li, and Xuegang Wang, “Software Architecture and Design for Airport Scene Surveillance Radar Data Processing System,” the 1st International Symposium on Education and Computer Science, Wuhan, China, 2009, pp.382-386.

[3] Lv xiaoping, “Technical resolution scheme for ground taxiing and surverllance at big airports,” Air traffic management, 2007(10), pp.9-13.

[4] Y. He, J. Xiu, J. Zhang and X. Guan. “Radar data processing and application,” Beijing: Electronic Industry Press (in Chinese), 2006.

[5] K Alsabti, S Ranka, and V Singh. “An efficient k-means clustering algorithm,” IPPS/SPDP Workshop on High Performance Data Mining, 1998, Orlando, Florida.

[6] L kaufman, and P J Rousseeuw, “Finding Groups in Data: an Introduction to Cluster Analysis,” John Wiley & Sons,1990.

[7] Raymond Ng.T., and Han Jiawei, “Efficient and Effective Clustering Methods for Spatial Data Mining,” Proceedings of 20th Very Large Databases Conference, Santiago, Chile, 1994, pp.144-155.

[8] M Ester, H-P Kriegel, J Sander, and X Xu, “A densitybased algorithm for discovering cluster in large spatial databases,” Proc. 1996 Int. Conf. Knowledge Discovery and Data Mining. Portland, USA. Aug. 1996, pp.226-231.

[9] W Wang, J Yang, and R Muntz, “STING: A Statistical Information grid Approach to Spatial Data Mining,” In:Proceedings of the 23rd VLDB Conference, Athens,Greece, 1997, pp.186-195.

[10] Xu X., Ester M., Kriegel H.P., and Sander J., “A distribution based clustering algorithm for mining in large spatial databases,” Proceedings of the IEEE International Conference on Data Engineering, 1998, pp.324-331.

[11] G Sheikholeslami, S Chatterjee, and A Zhang. “WaveCluster: A multi-resolusion clustering approach for very large spatial databases,” Proc. 1998 Int. Conf. Very Large DataBases. New York, USA. Aug. 1988, pp.428-439.

[12] R Agrawal, J Gehrke, D Gunopulos, and P Raghava,“Automatic Subspace Clustering of High Dimensional Data for Data Mining Applications,” Proc. Of ACM SIGMOD International Conference on Management of Data, Seattle, USA, June, 1998, pp.94-105.

[13] Zhang T., Ramakrishnan R., and Livny M., “BIRCH: An efficient data clustering method for very large database,” Proc. 1996 ACM SIGMOD Int. Conf. Management Data. Montreal, Canada. 1996, pp.103-114.

[14] Kohonen T., “Self-organized algorithm of topologically correct feature maps,” Biological Cybernetics, 1982, pp.59-69.

[15] Kaufman L., and Rousseeuw P.J., “Finding Groups in Data: an Introduction to Cluster Analysis,” John Wiley & Sons, 1990.

[16] LIU Xiao-Ying, and WANG Guo-Ren, “SUDBC: a Quickly Clustering Algorithm Based on Spatial Unit Density. mini-micro systems,” Vol.26 No.12, Dec. 2005, pp.2216-2220.